On the chromatic number of a family of odd hole free graphs

Jialei Song, Baogang Xu

A hole is an induced cycle of length at least 4, and an odd hole is a hole of odd length. A full house is a graph composed by a vertex adjacent to both ends of an edge in $K_4$ . L…