Every planar graph has an acyclic 7-coloring

From MaRDI portal
Publication:1245228

DOI10.1007/BF02759792zbMath0374.05022MaRDI QIDQ1245228

Michael O. Albertson, David M. Berman

Publication date: 1977

Published in: Israel Journal of Mathematics (Search for Journal in Brave)




Related Items (37)

Construction of acyclically 4-colourable planar triangulations with minimum degree 4A sufficient condition for planar graphs to be acyclically 5-choosableGood and semi-strong colorings of oriented planar graphsOn acyclic colorings of graphs on surfacesAcyclic coloring with few division verticesAcyclic 4-choosability of planar graphsAcyclic colorings of graph subdivisions revisitedAn improved upper bound for the acyclic chromatic number of 1-planar graphsInjective edge-coloring of subcubic graphsGraphs with maximum degree \(6\) are acyclically \(11\)-colorableAcyclic 4-choosability of planar graphs without intersecting short cyclesPlanar graphs without 4- and 5-cycles are acyclically 4-choosableAcyclic vertex coloring of graphs of maximum degree sixAcyclic 6-choosability of planar graphs without adjacent short cyclesAcyclic 4-choosability of planar graphs without 4-cyclesAcyclic 5-choosability of planar graphs without 4-cyclesAcyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphsAcyclic 5-choosability of planar graphs without 4-cyclesAcyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐CyclesAcyclic colorings of locally planar graphsAcyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cyclesAcyclic 4-choosability of planar graphs without adjacent short cyclesOn acyclic 4-choosability of planar graphs without short cyclesOn acyclic colorings of planar graphs. (Reprint)Circular vertex arboricityAcyclic chromatic indices of planar graphs with large girthAn acyclic analogue to Heawood's theoremAcyclic \(L\)-coloring of graphs with maximum degrees 5 and 6On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9Acyclic 3-coloring of generalized Petersen graphsOn acyclic colorings of planar graphsPlanar graphs without 4-cycles are acyclically 6-choosableAcyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cyclesAcyclic coloring of IC-planar graphsAcyclic \(k\)-strong coloring of maps on surfacesPlanar graphs without 4, 5 and 8-cycles are acyclically 4-choosableA Conjecture of Borodin and a Coloring of Grünbaum



Cites Work


This page was built for publication: Every planar graph has an acyclic 7-coloring