On acyclic colorings of planar graphs

https://doi.org/10.1016/0012-365X(79)90077-3Get rights and content
Under an Elsevier user license
open archive

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.

Cited by (0)