Hamiltonian connectedness in 3-connected line graphs

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

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

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 graphscollapsible graphshourglassHamiltonian connected

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

A note on edge-disjoint Hamilton cycles in line graphs, Hamilton-connectivity of line graphs with application to their detour index, On the \(s\)-hamiltonianicity of an hourglass-free line graph, Hamiltonicity of 6-connected line graphs, Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs, Hamiltonian connected hourglass free line graphs, On 3-connected Hamiltonian line graphs, Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs, Collapsible graphs and Hamiltonian connectedness of line graphs, Degree sum and Hamiltonian-connected line graphs, Chvátal-Erdős conditions and almost spanning trails, Recent advances on the Hamiltonian problem: survey III, On \(s\)-Hamiltonicity of net-free line graphs, Multigraphic degree sequences and Hamiltonian-connected line graphs, Panconnected index of graphs, Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected, Spanning trails in essentially 4-edge-connected graphs, Collapsible graphs and Hamiltonicity of line graphs, On the extended Clark-Wormold Hamiltonian-like index problem, On \(s\)-Hamiltonian line graphs of claw-free graphs, Complete family reduction and spanning connectivity in line graphs, Catlin’s reduced graphs with small orders, A condition on Hamilton-connected line graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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