Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
From MaRDI portal
Publication:345079
DOI10.1016/J.JCTB.2016.05.009zbMATH Open1350.05086OpenAlexW2413683251MaRDI QIDQ345079FDOQ345079
Authors: Hong-Jian Lai, Zhi-Hong Chen, Liming Xiong 
Publication date: 25 November 2016
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.2016.05.009
Recommendations
- Hamiltonicity in 3-connected claw-free graphs
- Hamiltonicity and minimum degree in 3-connected claw-free graphs
- Hamiltonian claw-free graphs involving minimum degrees
- Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
- Hamiltonicity and degrees of adjacent vertices in claw-free graphs
Hamiltonian cycleclaw-free graphCatlin's reduction methodminimum degree conditionRyjáček's closure concept
Cites Work
- Graphs without spanning closed trails
- Claw-free graphs---a survey
- On a closure concept in claw-free graphs
- Hamiltonicity in 3-connected claw-free graphs
- Graph theory with applications
- Longest paths and cycles in K1,3-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 claw-free graphs involving minimum degrees
- Hamiltonian cycles in 3-connected claw-free graphs
- Hamiltonicity and minimum degree in 3-connected claw-free graphs
- Recent advances on the Hamiltonian problem: survey III
- Hamiltonian cycles in 3‐connected claw‐free graphs
- Title not available (Why is that?)
- Clique covering and degree conditions for Hamiltonicity in claw-free graphs
Cited In (13)
- Hamiltonicity of claw-free graphs and Fan-type conditions
- Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected
- On 3-stable number conditions in \(n\)-connected claw-free graphs
- Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
- Minimum implicit degree condition restricted to claws for Hamiltonian cycles
- On cycle-nice claw-free graphs
- Circumferences of 3-connected claw-free graphs. II.
- Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs
- Hamiltonicity in 3-connected claw-free graphs
- Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
- Hamilton-connected claw-free graphs with Ore-degree conditions
- Hamiltonian claw-free graphs involving minimum degrees
- Hamiltonicity and minimum degree in 3-connected claw-free graphs
This page was built for publication: Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q345079)
