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

DOI10.1016/J.DISC.2007.09.045MaRDI QIDQ2519848zbMATH OpenOpenAlexFDO

Authors Hong-Jian Lai, Yehong Shao, Mingquan Zhan

Publication date 27 January 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2007.09.045

zbMATH Keywords

collapsible graphHamiltonian connected graphline graphquasi claw-free graph

Mathematics Subject Classification ID

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

Recommendations

• All 4-connected line graphs of claw free graphs are Hamiltonian connected
• Every 4-connected line graph of a planar graph is Hamiltonian
• Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs
• Hamilton connectivity of line graphs and claw‐free graphs
• Hamiltonicity of 2-connected quasi-claw-free graphs
• Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
• Hamiltonicity of 4-connected line graph of a planar graph
• Hamiltonian connectedness in claw-free graphs
• Hamiltonian connectedness in claw-free graphs
• Hamiltonian connected claw-free graphs

Cites work

• A reduction method to find spanning Eulerian subgraphs
• All 4-connected line graphs of claw free graphs are Hamiltonian connected
• Every 4-connected line graph of a planar graph is Hamiltonian
• Graph theory
• Graphs without spanning closed trails
• Hamiltonian connectedness in 3-connected line graphs
• Hamiltonian results inK1,3-free graphs
• scientific article; zbMATH DE number 3987316 (Why is no real title available?)
• scientific article; zbMATH DE number 2192202 (Why is no real title available?)
• On a closure concept in claw-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• On hamiltonian line graphs and connectivity
• Reflections on graph theory

Cited in

(12)

• On the s-hamiltonianicity of an hourglass-free line graph
• On \(s\)-Hamiltonian line graphs of claw-free graphs
• Recent advances on the Hamiltonian problem: survey III
• Hamilton cycles in 6-connected claw-free graphs (extended abstract)
• A note on edge-disjoint Hamilton cycles in line graphs
• Hamilton cycles in 5-connected line graphs
• On 3-connected Hamiltonian line graphs
• Panconnected index of graphs
• The spanning connectivity of line graphs
• Hamiltonicity of 6-connected line graphs
• On traceable iterated line graph and Hamiltonian path index
• How many conjectures can you stand? A survey

This page was built for publication: Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected

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