Claw-free graphs and 2-factors that separate independent vertices
From MaRDI portal
Publication:2891039
DOI10.1002/jgt.20579zbMath1242.05153OpenAlexW2131821097MaRDI QIDQ2891039
Kenta Ozeki, Kiyoshi Yoshimoto, Ralph J. Faudree, Colton Magnant
Publication date: 13 June 2012
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20579
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
Related Items (5)
Circumferences of 2-factors in claw-free graphs ⋮ 2-factors and independent sets on claw-free graphs ⋮ 2-factors in claw-free graphs with lower bounds cycle lengths ⋮ 2-factors with bounded number of components in claw-free graphs ⋮ Star decomposition of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
- Cycles and paths through specified vertices in k-connected graphs
- On a closure concept in claw-free graphs
- On the number of components in 2-factors of claw-free graphs
- Hamiltonian results inK1,3-free graphs
- Regular factors in K1,3‐free graphs
- Regular factors in K1,n free graphs
- Closure, 2-factors, and cycle coverings in claw-free graphs
This page was built for publication: Claw-free graphs and 2-factors that separate independent vertices