Thomassen conjectured that every 4-connected line graph is hamiltonian. A vertex cut X of G is essential if G-X has at least two nontrivial components. We prove that every 3-conne...
1 A graph G is hamiltonian-connected if any two of its vertices are connected by a Hamilton2 path (a path including every vertex of G); and G is s-hamiltonian-connected if the del...
For an integer k > 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-cycles of G. In (J Graph Theory 11:399–407 (1987)), Broersma and Veldman propo...
We show that the conjectures by Matthews and Sumner (every 4-connected claw-free graph is hamiltonian), by Thomassen (every 4-connected line graph is hamiltonian) and by Fleischne...