Hamiltonicity in 2-connected graphs with claws
From MaRDI portal
Publication:1382829
DOI10.1016/S0012-365X(97)00056-3zbMATH Open0893.05009OpenAlexW2059242370MaRDI QIDQ1382829FDOQ1382829
Publication date: 11 August 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00056-3
Cites Work
- Title not available (Why is that?)
- Longest paths and cycles in K1,3-free graphs
- Some Theorems on Abstract Graphs
- Hamiltonian results inK1,3-free graphs
- Dominating cycles in regular 3-connected graphs
- Hamiltonian cycles in 3-connected claw-free graphs
- Hamiltonian cycles in 3‐connected claw‐free graphs
- Hamilton cycles in claw-free graphs
- Toughness and hamiltonicity in almost claw-free graphs
- On Hamiltonian claw-free graphs
- Hamiltonian cycles in \(2\)-connected claw-free graphs
Cited In (10)
- Extremal problems for forbidden pairs that imply hamiltonicity
- Claw-free graphs---a survey
- \(D_ \lambda\)-cycles in 3-cyclable graphs
- Title not available (Why is that?)
- Sufficient condition for Hamiltonicity of \(N_2\)-locally connected claw-free graphs
- Title not available (Why is that?)
- Hamiltonicity in Partly claw-free graphs
- Hamiltonicity of 2-connected claw-center independent graphs
- On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
- Neighborhood conditions for graphs with induced claws
Recommendations
This page was built for publication: Hamiltonicity in 2-connected graphs with claws
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382829)