Every 3-connected, essentially 11-connected line graph is Hamiltonian

MaRDI QIDQ3576722zbMATH OpenFDO

Authors Hong-Jian Lai, Yehong Shao, Ju Zhou, Hehui Wu

Publication date 30 July 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAE0173/0.html

zbMATH Keywords

line graphclaw-free graphcollapsible graphHamiltonian graphdominating Eulerian subgraphsupereulerian graphsessential connectivity

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Every 3-connected, essentially 11-connected line graph is Hamiltonian
• Every 3-connected essentially 10-connected line graph is Hamilton-connected
• Hamiltonicity of 3-connected line graphs
• The Hamiltonicity of essentially 9‐connected line graphs
• Hamilton cycles in 5-connected line graphs

Cited in

(10)

• Hamilton cycles in 6-connected claw-free graphs (extended abstract)
• On 3-connected Hamiltonian line graphs
• Hamilton cycles in 5-connected line graphs
• Collapsible graphs and Hamiltonian connectedness of line graphs
• Thomassen's conjecture for line graphs of 3-hypergraphs
• Hamiltonicity of 3-connected line graphs
• Hamiltonian connectedness in 3-connected line graphs
• Every 3-connected essentially 10-connected line graph is Hamilton-connected
• On the extended Clark-Wormold Hamiltonian-like index problem
• Every 3-connected, essentially 11-connected line graph is Hamiltonian

This page was built for publication: Every 3-connected, essentially 11-connected line graph is Hamiltonian

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576722)