On the number of components in 2-factors of claw-free graphs
From MaRDI portal
Publication:2461206
DOI10.1016/j.disc.2006.11.022zbMath1129.05037OpenAlexW2074114001MaRDI QIDQ2461206
Publication date: 27 November 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.11.022
Related Items (15)
Claw-free graphs and 2-factors that separate independent vertices ⋮ Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs ⋮ Circumferences of 2-factors in claw-free graphs ⋮ 2-Factors in claw-free graphs with locally disconnected vertices ⋮ On components of 2-factors in claw-free graphs ⋮ On 2-factors with a bounded number of odd components ⋮ On 2-factors in claw-free graphs whose edges are in small cycles ⋮ 2-factors and independent sets on claw-free graphs ⋮ 2-factors in claw-free graphs with lower bounds cycle lengths ⋮ Even subgraphs of bridgeless graphs and 2-factors of line graphs ⋮ Unnamed Item ⋮ Computing Sharp 2-Factors in Claw-Free Graphs ⋮ Computing sharp 2-factors in claw-free graphs ⋮ 2-factors with bounded number of components in claw-free graphs ⋮ Two operations on a graph preserving the (non)existence of 2-factors in its line graph
Cites Work
- Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
- On 2-factors in claw-free graphs
- On a closure concept in claw-free graphs
- Even subgraphs of bridgeless graphs and 2-factors of line graphs
- Hamiltonian results inK1,3-free graphs
- Spanning even subgraphs of 3‐edge‐connected 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
- Two-factors with few cycles in claw-free graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: On the number of components in 2-factors of claw-free graphs
