Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures

DOI10.1016/j.dam.2011.06.031zbMath1239.05080OpenAlexW1996920746MaRDI QIDQ411838

Yori Zwols, Maria Chudnovsky, Bernard Ries

Publication date: 30 April 2012

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

Full work available at URL: https://doi.org/10.1016/j.dam.2011.06.031

zbMATH Keywords

forbidden induced subgraphswireless networkingclaw-free graphsstructural graph theorystrongly perfect graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Perfect graphs (05C17)

Related Items (1)

Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs

Cites Work

• Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs
• The strong perfect graph theorem
• Kernels in perfect line-graphs
• Claw-free graphs. V. Global structure
• Which claw-free graphs are strongly perfect?
• Unnamed Item
• Unnamed Item

This page was built for publication: Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures