Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4

2021/02/17 by Brause, Christoph, Doan, Trung Duy, Holub, Přemysl +4 · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2102.08783

Abstract

For every graph X, we consider the class of all connected \K_1,3, X\-free graphs which are distinct from an odd cycle and have independence number at least 4, and we show that all graphs in the class are perfect if and only if X is an induced subgraph of some of P₆, K₁ ∪ P₅, 2P₃, Z₂ or K₁ ∪ Z₁. Furthermore, for X chosen as 2K₁ ∪ K₃, we list all eight imperfect graphs belonging to the class; and for every other choice of X, we show that there are infinitely many such graphs. In addition, for X chosen as B_1,2, we describe the structure of all imperfect graphs in the class.

Cited by

• On k-colorability of (bull, H)-free graphs

Related

• On forbidden induced subgraphs for K_1,3-free perfect graphs
• Strongly Perfect Claw-free Graphs -- A Short Proof
• Forbidden induced pairs for perfectness and ω-colourability of graphs
• On the choosability of claw-free perfect graphs
• Perfect divisibility of (fork, antifork∪ K₁)-free graphs