<p>We introduce path-conjoined graphs defined for two rooted graphs by joining their roots with a path, and investigate the chromatic symmetric functions of its two generalizations: spider-conjoined graphs and chain-conjoined graphs. By using the composition method developed by Zhou and the third author recently, we obtain neat positive <i>e</i>_<i>I</i>-expansions for the chromatic symmetric functions of clique-path-cycle graphs, path-clique-path graphs, and clique-clique-path graphs. We pose the <i>e</i>-positivity conjecture for hat-chains.</p>