Title of article
On acyclic colorings of planar graphs Original Research Article
Author/Authors
O.V. Borodin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
20
From page
953
To page
972
Abstract
The conjecture of B. Grünbaum on existing of admissible vertex coloring of every planar graph with 5 colors, in which every bichromatic subgraph is acyclic, is proved and some corollaries of this result are discussed in the present paper.
Journal title
Discrete Mathematics
Serial Year
2006
Journal title
Discrete Mathematics
Record number
948123
Link To Document