| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651340 | Discrete Mathematics | 2006 | 20 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
O.V. Borodin,