Abstract
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).
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have