The perfect divisibility and chromatic number of some odd hole-free graphs

Abstract

A hole is an induced cycle of length at least 4, and an odd hole is a hole of odd length. It is NP-hard to color the vertices of an odd hole-free graph. A graph $G$ is perfectly divisible if every induced subgraph $H$ of $G$ with at least one edge admits a partition of $V(H)$ into sets $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. $G$ is short-holed if every hole in $G$ has length 4. A hammer is the graph obtained by identifying one vertex of a $K_3$ and one end vertex of a $P_3$. In this paper, we prove that (i) (odd hole, hammer, $K_{2,3}$)-free graphs are perfectly divisible, (ii) $χ(G)\le 4ω(G)(ω(G)-1)$ if $G$ is short-holed and $(K_1+C_4)$-free, (iii) $χ(G)\le 2ω(G)-1$ if $G$ is short-holed and $(K_1\cup K_3)$-free, and (iv) $χ(G)\le 16ω(G)-24$ if $G$ is short-holed and $(K_1+(K_1\cup K_3))$-free.

Theorems & Definitions (14)

• Conjecture 1: HCT18
• Theorem 1
• Theorem 2: SV18
• Theorem 3
• Theorem 4
• Theorem 5
• proof : Proof of Theorem \ref{['hammer']}
• Lemma 6
• proof : Proof
• proof : Proof of Theorem \ref{['short hole-1']}