Strongly perfect claw‐free graphs—A short proof

DOI10.1002/jgt.22659arXiv1912.05645OpenAlexW3120743840MaRDI QIDQ6080850

Cemil Dibek, Maria Chudnovsky

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.05645

zbMATH Keywords

induced subgraphsperfect graphsclaw-free graphsstrongly perfect graphs

Mathematics Subject Classification ID

Perfect graphs (05C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Which claw-free graphs are perfectly orderable?
• The strong perfect graph theorem
• Claw-free graphs. III: Circular interval graphs
• Recognizing claw-free perfect graphs
• Some classes of strongly perfect graphs
• A description of claw-free perfect graphs
• Which claw-free graphs are strongly perfect?
• Perfect Elimination and Chordal Bipartite Graphs
• Difference graphs
• Research problems

This page was built for publication: Strongly perfect claw‐free graphs—A short proof