Triangle-free four-chromatic graphs Original Research Article

For given n, let G be a triangle-free graph of order n with chromatic number at least 4. In this paper, we shall prove a conjecture of Häggkvist by determining the maximal value of δ(G).