scientific article; zbMATH DE number 3639666
From MaRDI portal
Publication:4200238
zbMath0412.05043MaRDI QIDQ4200238
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Construction of acyclically 4-colourable planar triangulations with minimum degree 4, A sufficient condition for planar graphs to be acyclically 5-choosable, Good and semi-strong colorings of oriented planar graphs, Colorings and girth of oriented planar graphs, On acyclic colorings of graphs on surfaces, Acyclic coloring with few division vertices, Acyclic 4-choosability of planar graphs, Acyclic colorings of graph subdivisions revisited, An improved upper bound for the acyclic chromatic number of 1-planar graphs, Injective edge-coloring of subcubic graphs, Improved bounds on linear coloring of plane graphs, Graphs with maximum degree \(6\) are acyclically \(11\)-colorable, Acyclic 4-choosability of planar graphs without intersecting short cycles, Planar graphs without 4- and 5-cycles are acyclically 4-choosable, Acyclic vertex coloring of graphs of maximum degree six, Acyclic 6-choosability of planar graphs without adjacent short cycles, Acyclic 4-choosability of planar graphs without 4-cycles, Acyclic 5-choosability of planar graphs without 4-cycles, Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs, Acyclic 5-choosability of planar graphs without 4-cycles, Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles, Acyclically 3-colorable planar graphs, Acyclic colorings of locally planar graphs, 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, Circular vertex arboricity, Acyclic chromatic indices of planar graphs with large girth, Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6, On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9, Every planar graph has an acyclic 7-coloring, Acyclic 3-coloring of generalized Petersen graphs, On acyclic colorings of planar graphs, Planar graphs without 4-cycles are acyclically 6-choosable, Linear coloring of planar graphs with large girth, 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, A Conjecture of Borodin and a Coloring of Grünbaum
