The chromatic number of {ISK4, diamond, bowtie}‐free graphs
The chromatic number of {ISK4, diamond, bowtie}‐free graphs
Abstract A graph is said to be ‐free if it does not contain any subdivision of as an induced subgraph. Lévêque, Maffray and Trotignon conjectured that every ‐free graph is 4‐colorable. In this paper, we show that this conjecture is true for the class of {, diamond, bowtie}‐free graphs, where …