Acyclic Colourings of Planar Graphs with Large Girth
From MaRDI portal
Publication:3839894
DOI10.1112/S0024610799007942zbMath0940.05032OpenAlexW2118910553MaRDI QIDQ3839894
Oleg V. Borodin, Douglas R. Woodall, Alexandr V. Kostochka
Publication date: 4 July 2000
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/s0024610799007942
Related Items (41)
Acyclically 4-colorable triangulations ⋮ Hamiltonicity and generalised total colourings of planar graphs ⋮ A sufficient condition for planar graphs to be acyclically 5-choosable ⋮ Acyclic colorings of subcubic graphs ⋮ Acyclic list 7‐coloring of planar graphs ⋮ Acyclic 5-choosability of planar graphs without adjacent short cycles ⋮ Acyclic coloring of graphs of maximum degree five: nine colors are enough ⋮ Star coloring of graphs with girth at least five ⋮ Acyclic 4-choosability of planar graphs ⋮ An improved upper bound for the acyclic chromatic number of 1-planar graphs ⋮ Injective edge-coloring of subcubic graphs ⋮ Acyclic vertex coloring of graphs of maximum degree 5 ⋮ \(k\)-forested coloring of planar graphs with large girth ⋮ Acyclic 4-choosability of planar graphs without intersecting short cycles ⋮ Planar graphs without 4- and 5-cycles are acyclically 4-choosable ⋮ Acyclic 6-choosability of planar graphs without adjacent short cycles ⋮ Acyclic 5-choosability of planar graphs without 4-cycles ⋮ Acyclic 5-choosability of planar graphs without 4-cycles ⋮ Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles ⋮ A Complexity Dichotomy for the Coloring of Sparse Graphs ⋮ Acyclically 3-colorable planar graphs ⋮ Online coloring graphs with high girth and high odd girth ⋮ 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 improper colouring of graphs with maximum degree 4 ⋮ Acyclic 4-choosability of planar graphs without adjacent short cycles ⋮ On acyclic 4-choosability of planar graphs without short cycles ⋮ Acyclic colouring of 1-planar graphs ⋮ Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6 ⋮ A polyhedral study of the acyclic coloring problem ⋮ Representing graphs as the intersection of cographs and threshold graphs ⋮ Acyclic and \(k\)-distance coloring of the grid ⋮ On star and caterpillar arboricity ⋮ Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope ⋮ \(k\)-forested choosability of planar graphs and sparse graphs ⋮ Planar graphs without 4-cycles are acyclically 6-choosable ⋮ 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 ⋮ Minimum feedback vertex set and acyclic coloring. ⋮ On some arboricities in planar graphs
This page was built for publication: Acyclic Colourings of Planar Graphs with Large Girth
