Hamiltonian cycles in 2‐connected claw‐free‐graphs
From MaRDI portal
Publication:4857444
DOI10.1002/jgt.3190200408zbMath0841.05062OpenAlexW2012979339MaRDI QIDQ4857444
Publication date: 14 July 1996
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190200408
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
Related Items
Hamiltonicity of 2-connected \(\{K_{1,4},K_{1,4}+e\}\)-free graphs, Claw-free graphs---a survey, Extremal problems on the Hamiltonicity of claw-free graphs, Degree and neighborhood conditions for Hamiltonicity of claw-free graphs, Leaf number and Hamiltonian \(C_4\)-free graphs, Disjoint cliques in claw-free graphs, Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs, Spanning paths and cycles in triangle-free graphs, Unnamed Item, On the circumference of 2-connected \(\mathcal{P}_{3}\)-dominated graphs, Hamiltonicity of 2-connected quasi-claw-free graphs, Triangles in claw-free graphs, Minimum degree, leaf number and traceability
Cites Work