Hamilton cycles in 3-connected claw-free and net-free graphs
From MaRDI portal
Publication:1942672
DOI10.1016/j.disc.2012.12.016zbMath1260.05091OpenAlexW2043865989MaRDI QIDQ1942672
Publication date: 19 March 2013
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.12.016
claw-free graphsforbidden subgraphsHamiltonian graphssupereulerian graphsnet-free graphs\(P_{k}\)-free graphs
Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (8)
Hamiltonian line graphs with local degree conditions ⋮ Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs ⋮ Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian ⋮ Hamiltonicities of double domination critical and stable claw-free graphs ⋮ On \(s\)-Hamiltonicity of net-free line graphs ⋮ Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs ⋮ Nowhere-zero 3-flows of claw-free graphs ⋮ The local structure of claw-free graphs without induced generalized bulls
This page was built for publication: Hamilton cycles in 3-connected claw-free and net-free graphs
