Title of article
4-chromatic graphs with large odd girth Original Research Article
Author/Authors
Nguyen Van Ngoc، نويسنده , , Zsolt Tuza، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1994
Pages
6
From page
387
To page
392
Abstract
It is known that the Mycielski graph can be generalized to obtain an infinite family of 4-chromatic graphs with no short odd cycles. The first proof of this result, due to Stiebitz, applied the topological method of Lovász. The proof presented here is elementary combinatorial.
Journal title
Discrete Mathematics
Serial Year
1994
Journal title
Discrete Mathematics
Record number
943508
Link To Document