Hamiltonicity for K1, r‐free graphs
From MaRDI portal
Publication:4857442
DOI10.1002/jgt.3190200406zbMath0843.05072OpenAlexW2162986846MaRDI QIDQ4857442
Guantao Chen, Richard H. Schelp
Publication date: 13 August 1996
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190200406
Related Items (12)
Spanning spiders and light-splitting switches ⋮ Hamiltonicity of 2-connected \(\{K_{1,4},K_{1,4}+e\}\)-free graphs ⋮ Hamilton cycles in line graphs of 3-hypergraphs ⋮ Claw-free graphs---a survey ⋮ Minimum independent generalized \(t\)-degree and independence number in \(K_{1,r+1}\)-free graphs ⋮ On degree sum conditions for 2-factors with a prescribed number of cycles ⋮ Degree sum conditions for Hamiltonicity on \(k\)-partite graphs ⋮ On hamiltonian line graphs of hypergraphs ⋮ Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path ⋮ Spanning 3-ended trees in almost claw-free graphs ⋮ Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs ⋮ Minimum path cover in quasi-claw-free graphs
Cites Work
This page was built for publication: Hamiltonicity for K1, r‐free graphs
