Closure concept for 2-factors in claw-free graphs

DOI10.1016/J.DISC.2010.02.004zbMath1225.05208OpenAlexW2120974719MaRDI QIDQ968436

Kiyoshi Yoshimoto, Zdeněk Ryjáček, Limning Xiong

Publication date: 5 May 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2010.02.004

zbMATH Keywords

claw-free graphline graph2-factor closuredominating system

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

2-Factors in claw-free graphs with locally disconnected vertices ⋮ Closure and forbidden pairs for 2-factors ⋮ Closure operation for even factors on claw-free graphs ⋮ Stability of Hereditary Graph Classes Under Closure Operations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Claw-free graphs---a survey
• On a closure concept in claw-free graphs
• On graph closures
• Closure concepts: A survey
• Closure, 2-factors, and cycle coverings in claw-free graphs
• Contractibility techniques as a closure concept
• Strengthening the closure concept in claw-free graphs

This page was built for publication: Closure concept for 2-factors in claw-free graphs