Discrete MathematicsVolume 25, Issue 3, 1979, Pages 211-236On acyclic colorings of planar graphsAuthor links open overlay panelO.V. BorodinShow moreShareCitehttps://doi.org/10.1016/0012-365X(79)90077-3Get rights and contentUnder an Elsevier user licenseopen archiveAbstractThe 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.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1979 Published by Elsevier B.V.