2-Factors in claw-free graphs with locally disconnected vertices
From MaRDI portal
Publication:2947989
DOI10.1007/s10587-015-0177-2zbMath1363.05123OpenAlexW2169374863MaRDI QIDQ2947989
Limning Xiong, Runli Tian, Mingqiang An
Publication date: 29 September 2015
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10338.dmlcz/144271
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Closure concept for 2-factors in claw-free graphs
- On a closure concept in claw-free graphs
- Sufficient condition for Hamiltonicity of \(N_2\)-locally connected claw-free graphs
- Hamiltonian claw-free graphs with locally disconnected vertices
- On the number of components in 2-factors of claw-free graphs
- Forbidden subgraphs that imply 2-factors
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Regular factors in K1,3‐free graphs
- Regular factors in K1,n free graphs
- Closure, 2-factors, and cycle coverings in claw-free graphs
- Hamiltonicity and forbidden subgraphs in 4‐connected graphs
- Hamiltonian circuits in N2‐locally connected K1,3‐free graphs
This page was built for publication: 2-Factors in claw-free graphs with locally disconnected vertices