Connected even factors in claw-free graphs

DOI10.1016/J.DISC.2007.04.058zbMath1143.05067OpenAlexW2025885914MaRDI QIDQ2483413

Hajo J. Broersma, Ming-Chu Li, Limning Xiong

Publication date: 28 April 2008

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

Full work available at URL: https://research.utwente.nl/en/publications/connected-even-factors-in-clawfree-graphs(5205e1f6-fc38-481d-85cb-564d069c1518).html

zbMATH Keywords

cycleclaw-free graphconnected even factor

Mathematics Subject Classification ID

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

Related Items (5)

Tank-ring factors in supereulerian claw-free graphs ⋮ Connected even factors in the square of essentially 2-edge-connected graph ⋮ Forbidden pairs for connected even factors in supereulerian graphs ⋮ Induced claws and existence of even factors of graphs ⋮ Connected even factors in \(k\)-tree

Cites Work

• Unnamed Item
• On factors of 4-connected claw-free graphs
• Hamiltonian results inK1,3-free graphs
• A Note on Sub-Eulerian Graphs
• Hourglasses and Hamilton cycles in 4‐connected claw‐free graphs

This page was built for publication: Connected even factors in claw-free graphs