Author of the publication

Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected.

, , and . Discret. Math., 308 (22): 5312-5316 (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Hamiltonian N2-locally connected claw-free graphs., , and . J. Graph Theory, 48 (2): 142-146 (2005)Degree condition and Z3-connectivity., , and . Discret. Math., 312 (10): 1658-1669 (2012)s-Vertex Pancyclic Index., , , , and . Graphs Comb., 28 (3): 393-406 (2012)Every 3-connected, essentially 11-connected line graph is Hamiltonian., , , and . J. Comb. Theory, Ser. B, 96 (4): 571-576 (2006)Unsupervised Anomaly Detection Algorithm of Graph Data Based on Graph Kernel., , , , and . CSCloud, page 58-63. IEEE Computer Society, (2017)Spanning eulerian subgraphs in N2-locally connected claw-free graphs., , , and . Ars Comb., (2010)Essential edge connectivity of line graphs.. Discret. Math., 341 (12): 3441-3446 (2018)Bounds on the connectivity of iterated line graphs.. Electron. J. Graph Theory Appl., 10 (2): 565-573 (2022)Hamiltonian connectedness in 3-connected line graphs., , , and . Discret. Appl. Math., 157 (5): 982-990 (2009)On mod (2p+1)-orientations of graphs., , , and . J. Comb. Theory, Ser. B, 99 (2): 399-406 (2009)