Closure, 2-factors, and cycle coverings in claw-free graphs

DOI10.1002/(SICI)1097-0118(199910)32:2%3C109::AID-JGT1%3E3.0.CO;2-OMaRDI QIDQ4700525zbMATH OpenOpenAlexFDO

Authors Zdeněk Ryjáček, Akira Saito, R. H. Schelp

Publication date 27 February 2000

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199910)32:2%3C109::aid-jgt1%3E3.0.co;2-o

zbMATH Keywords

claw-free graphclosure2-factorcycle covering

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Strengthening the closure concept in claw-free graphs
• Closure concept for 2-factors in claw-free graphs
• Closure, path-factors and path coverings in claw-free graphs

Cited in

(32)

• Computing sharp 2-factors in claw-free graphs
• How many conjectures can you stand? A survey
• Computing Sharp 2-Factors in Claw-Free Graphs
• On 2-factors with a specified number of components in line graphs
• Claw-free graphs and 2-factors that separate independent vertices
• 2-factors with bounded number of components in claw-free graphs
• Graph factors and factorization: 1985--2003: a survey
• The \(*\)-closure for graphs and claw-free graphs
• 2-factors in claw-free graphs with locally disconnected vertices.
• Strengthening the closure concept in claw-free graphs
• Even factors with a bounded number of components in iterated line graphs
• Closure, path-factors and path coverings in claw-free graphs
• On the number of components in 2-factors of claw-free graphs
• 2-factors in claw-free graphs
• Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs
• Forbidden subgraphs that imply 2-factors
• 2-factors and independent sets on claw-free graphs
• Circumferences of 2-factors in claw-free graphs
• 2-factors in claw-free graphs with lower bounds cycle lengths
• On 2-factors with a bounded number of odd components
• On components of 2-factors in claw-free graphs
• Forbidden pairs of disconnected graphs for 2‐factor of connected graphs
• Closure concept for 2-factors in claw-free graphs
• Even subgraphs of bridgeless graphs and 2-factors of line graphs
• Pairs of forbidden subgraphs and 2-connected supereulerian graphs
• Stability of hereditary graph classes under closure operations
• Two operations on a graph preserving the (non)existence of 2-factors in its line graph.
• The existence of spanning ended system on claw-free graphs
• Closure, stability and iterated line graphs with a 2-factor
• On 2-factors in claw-free graphs whose edges are in small cycles
• Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
• A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs

This page was built for publication: Closure, 2-factors, and cycle coverings in claw-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4700525)