Closure, 2-factors, and cycle coverings in claw-free graphs
From MaRDI portal
Publication:4700525
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199910)32:2<109::AID-JGT1>3.0.CO;2-O" /><109::AID-JGT1>3.0.CO;2-O 10.1002/(SICI)1097-0118(199910)32:2<109::AID-JGT1>3.0.CO;2-OzbMath0932.05045OpenAlexW4252645815MaRDI QIDQ4700525
Zdeněk Ryjáček, Akira Saito, Richard H. Schelp
Publication date: 27 February 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199910)32:2<109::aid-jgt1>3.0.co;2-o
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (28)
Even factors with a bounded number of components in iterated line graphs ⋮ 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 ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs ⋮ Circumferences of 2-factors in claw-free graphs ⋮ 2-Factors in claw-free graphs with locally disconnected vertices ⋮ Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs ⋮ Forbidden pairs of disconnected graphs for 2‐factor of connected graphs ⋮ 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 ⋮ How many conjectures can you stand? A survey ⋮ 2-factors in claw-free graphs with lower bounds cycle lengths ⋮ Even subgraphs of bridgeless graphs and 2-factors of line graphs ⋮ On the number of components in 2-factors of claw-free graphs ⋮ Pairs of forbidden subgraphs and 2-connected supereulerian graphs ⋮ Forbidden subgraphs that imply 2-factors ⋮ Closure concept for 2-factors in claw-free graphs ⋮ Unnamed Item ⋮ Computing Sharp 2-Factors in Claw-Free Graphs ⋮ Computing sharp 2-factors in claw-free graphs ⋮ The existence of spanning ended system on claw-free graphs ⋮ 2-factors with bounded number of components in claw-free graphs ⋮ Closure, stability and iterated line graphs with a 2-factor ⋮ Two operations on a graph preserving the (non)existence of 2-factors in its line graph ⋮ Stability of Hereditary Graph Classes Under Closure Operations
This page was built for publication: Closure, 2-factors, and cycle coverings in claw-free graphs
