On 2-factors in claw-free graphs whose edges are in small cycles
From MaRDI portal
(Redirected from Publication:456652)
Recommendations
Cites work
- scientific article; zbMATH DE number 1289749 (Why is no real title available?)
- Closure, 2-factors, and cycle coverings in claw-free graphs
- Graph theory
- On a closure concept in claw-free graphs
- On the number of components in 2-factors of claw-free graphs
- Regular factors in K1,3‐free graphs
- Regular factors in K1,n free graphs
Cited in
(6)- Computing sharp 2-factors in claw-free graphs
- Computing Sharp 2-Factors in Claw-Free Graphs
- On 2-factors with given properties in claw-free graphs
- 2-factors in claw-free graphs with lower bounds cycle lengths
- On 2-factors in 5-cycle connected claw-free graphs
- Two operations on a graph preserving the (non)existence of 2-factors in its line graph.
This page was built for publication: On 2-factors in claw-free graphs whose edges are in small cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456652)