Note to the paper of Grünbaum on acyclic colorings
From MaRDI portal
Publication:1222168
DOI10.1016/0012-365X(76)90075-3zbMath0318.05103MaRDI QIDQ1222168
Alexandr V. Kostochka, Leonid S. Mel'nikov
Publication date: 1976
Published in: Discrete Mathematics (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Acyclically 4-colorable triangulations, Construction of acyclically 4-colourable planar triangulations with minimum degree 4, Hamiltonicity and generalised total colourings of planar graphs, A sufficient condition for planar graphs to be acyclically 5-choosable, Oriented colorings of triangle-free planar graphs, A feedback vertex set of 2-degenerate graphs, Acyclic list 7‐coloring of planar graphs, Acyclic 5-choosability of planar graphs without adjacent short cycles, On star 5-colorings of sparse graphs, On acyclic colorings of graphs on surfaces, Acyclic edge coloring of planar graphs without small cycles, Acyclic coloring of graphs without bichromatic long path, Acyclic 4-choosability of planar graphs, An improved upper bound for the acyclic chromatic number of 1-planar graphs, The method of coloring in graphs and its application, Planar graphs without 4- and 5-cycles are acyclically 4-choosable, Every toroidal graph is acyclically 8-choosable, Acyclic 6-choosability of planar graphs without adjacent short cycles, Acyclic 5-choosability of planar graphs without 4-cycles, Star coloring planar graphs from small lists, Acyclic 5-choosability of planar graphs without 4-cycles, An introduction to the discharging method via graph coloring, 6-Star-Coloring of Subcubic Graphs, Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles, Acyclically 3-colorable planar graphs, Acyclic colorings of locally planar graphs, Acyclic 3-choosability of sparse graphs with girth at least 7, Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles, Acyclic 4-choosability of planar graphs without adjacent short cycles, On acyclic 4-choosability of planar graphs without short cycles, Acyclic edge chromatic number of outerplanar graphs, Acyclic colouring of 1-planar graphs, Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6, Star coloring bipartite planar graphs, Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles, On acyclic colorings of planar graphs, On acyclically 4-colorable maximal planar graphs, Acyclic edge coloring of planar graphs with large girth, Planar graphs without 4-cycles are acyclically 6-choosable, Acyclic edge colorings of planar graphs and series parallel graphs, Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles, Acyclic coloring of IC-planar graphs, Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable, Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth, On some arboricities in planar graphs
Cites Work
