Two-factors with few cycles in claw-free graphs

DOI10.1016/S0012-365X(00)00317-4zbMath0979.05084OpenAlexW2078527193WikidataQ126988790 ScholiaQ126988790MaRDI QIDQ5937588

Ronald J. Gould, Michael S. Jacobson

Publication date: 17 February 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00317-4

zbMATH Keywords

\(2\)-factors in claw-free graphs

Mathematics Subject Classification ID

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

Related Items (10)

Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs ⋮ Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs ⋮ On components of 2-factors in claw-free graphs ⋮ 2-factors with the bounded number of components in line graphs ⋮ How many conjectures can you stand? A survey ⋮ Even subgraphs of bridgeless graphs and 2-factors of line graphs ⋮ On the number of components in 2-factors of claw-free graphs ⋮ 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

This page was built for publication: Two-factors with few cycles in claw-free graphs