Hamiltonicity in 3-connected claw-free graphs
From MaRDI portal
Publication:2496201
DOI10.1016/J.JCTB.2005.10.003zbMATH Open1095.05024OpenAlexW1977364731MaRDI QIDQ2496201FDOQ2496201
Authors: Hong-Jian Lai, Yehong Shao, Mingquan Zhan 
Publication date: 12 July 2006
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2005.10.003
Recommendations
Cites Work
- Graph theory
- On a closure concept in claw-free graphs
- A reduction method to find spanning Eulerian subgraphs
- Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
- Hamiltonian results inK1,3-free graphs
- Eulerian subgraphs and Hamilton-connected line graphs
- Hamiltonicity and minimum degree in 3-connected claw-free graphs
- Clique covering and degree conditions for Hamiltonicity in claw-free graphs
- Eulerian subgraphs containing given vertices and hamiltonian line graphs
- Title not available (Why is that?)
Cited In (22)
- Circumferences of 3-connected claw-free graphs
- Every 3-connected distance claw-free graph is Hamilton-connected
- Forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs
- Recent advances on the Hamiltonian problem: survey III
- Characterizing forbidden clawless triples implying Hamiltonian graphs
- Hamiltonicity of 6-connected line graphs
- Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
- Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected
- Circumferences and minimum degrees in 3-connected claw-free graphs
- Hamiltonian line graphs with local degree conditions
- Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
- Hamiltonian cycles in 3‐connected claw‐free graphs
- A conjecture of claw-free Hamiltonian graphs with neighborhood union
- On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs
- Extremal problems on the Hamiltonicity of claw-free graphs
- Circumferences of 3-connected claw-free graphs. II.
- Title not available (Why is that?)
- Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
- Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs
- Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs
- Hamiltonian claw-free graphs involving minimum degrees
- Hamiltonicity and minimum degree in 3-connected claw-free graphs
This page was built for publication: Hamiltonicity in 3-connected claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2496201)
