Four-color conjecture for ISK4-free graphs

A graph is ISK4-free if it has no induced subdivision of $K_4$. ISK4-free four-color conjecture. Every ISK4-free graph is 4-colorable. The preceding theorem gives a constant bound on the chromatic number of ISK4-free graphs, and the source notes that no example with chromatic number at least $5$ is known.