Title of article
Triangle-free four-chromatic graphs Original Research Article
Author/Authors
Guoping Jin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
20
From page
151
To page
170
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).
Journal title
Discrete Mathematics
Serial Year
1995
Journal title
Discrete Mathematics
Record number
943651
Link To Document