Hamiltonian connectedness in 3-connected line graphs

DOI10.1016/j.dam.2008.02.005zbMath1169.05344MaRDI QIDQ1028425

Hong-Jian Lai, Mingquan Zhan, Gexin Yu, Yehong Shao

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.02.005

zbMATH Keywords

core graphs; collapsible graphs; hourglass; Hamiltonian connected

Mathematics Subject Classification ID

05C40: Connectivity

05C45: Eulerian and Hamiltonian graphs

Related Items

A note on edge-disjoint Hamilton cycles in line graphs, Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs, On 3-connected Hamiltonian line graphs, Collapsible graphs and Hamiltonian connectedness of line graphs, Hamiltonicity of 6-connected line graphs, Spanning trails in essentially 4-edge-connected graphs, Collapsible graphs and Hamiltonicity of line graphs, Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs, Hamiltonian connected hourglass free line graphs, Recent advances on the Hamiltonian problem: survey III, Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected

Cites Work

• The reduction of graph families closed under contraction
• Graphs without spanning closed trails
• All 4-connected line graphs of claw free graphs are Hamiltonian connected
• A reduction method to find spanning Eulerian subgraphs
• Supereulerian graphs: A survey
• Reflections on graph theory
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Graph family operations
• Unnamed Item
• Unnamed Item
• Unnamed Item