Closure concept for 2-factors in claw-free graphs

DOI10.1016/J.DISC.2010.02.004zbMATH Open1225.05208OpenAlexW2120974719MaRDI QIDQ968436FDOQ968436

Kiyoshi Yoshimoto, Zdeněk Ryjáček, Liming 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

Recommendations

• Closure operation for even factors on claw-free graphs
• Closure and forbidden pairs for 2-factors
• Closure, 2-factors, and cycle coverings in claw-free graphs
• The \(*\)-closure for graphs and claw-free graphs
• Closure concepts for claw-free graphs

zbMATH Keywords

line graphclaw-free 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)

Cites Work

• Graph theory
• Claw-free graphs---a survey
• On a closure concept in claw-free graphs
• On graph closures
• Title not available (Why is that?)
• Closure, 2-factors, and cycle coverings in claw-free graphs
• Title not available (Why is that?)
• Closure concepts: A survey
• Strengthening the closure concept in claw-free graphs
• Contractibility techniques as a closure concept

Cited In (7)

• Closure and forbidden pairs for 2-factors
• Closure, path-factors and path coverings in claw-free graphs
• Closure, stability and iterated line graphs with a 2-factor
• 2-Factors in claw-free graphs with locally disconnected vertices
• Closure operation for even factors on claw-free graphs
• Stability of hereditary graph classes under closure operations
• Contractibility techniques as a closure concept

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

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