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

DOI10.1016/J.DAM.2011.06.024zbMath1239.05079OpenAlexW2080110511MaRDI QIDQ411837

Bernard Ries, Yori Zwols, Maria Chudnovsky

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.024

zbMATH Keywords

forbidden induced subgraphswireless networkingclaw-free graphsstructural graph theorystrongly perfect graphs

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Structural characterization of families of graphs (05C75) Perfect graphs (05C17)

Related Items (2)

Connectedness of graphs and its application to connected matroids through covering-based rough sets ⋮ Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures

Cites Work

• Unnamed Item
• Unnamed Item
• Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures
• The strong perfect graph theorem
• Claw-free graphs. III: Circular interval graphs
• Claw-free graphs. V. Global structure
• Which claw-free graphs are strongly perfect?
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
• Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits

This page was built for publication: Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs