Acyclic Colourings of Planar Graphs with Large Girth

Recommendations

Acyclic chromatic indices of planar graphs with large girth
Acyclic chromatic indices of planar graphs with girth at least five
Acyclic edge-colouring of planar graphs (extended abstract)
Acyclic edge coloring of planar graphs with girth at least 5
Acyclic coloring of graphs with some girth restriction

Cited in

(52)

Acyclic and \(k\)-distance coloring of the grid
On star and caterpillar arboricity
Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
Acyclic colorings of locally planar graphs
Minimum feedback vertex set and acyclic coloring.
On acyclic colorings of graphs on surfaces
Planar graphs without 4- and 5-cycles are acyclically 4-choosable
Acyclic improper colouring of graphs with maximum degree 4
Representing graphs as the intersection of cographs and threshold graphs
An improved upper bound for the acyclic chromatic number of 1-planar graphs
Acyclic chromatic indices of planar graphs with large girth
Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6
Acyclic coloring of IC-planar graphs
The \(r\)-acyclic chromatic number of planar graphs
Acyclic coloring of graphs of maximum degree five: nine colors are enough
Acyclic edge coloring of planar graphs with girth at least 5
On acyclic colorings of planar graphs. (Reprint)
Acyclically 4-colorable triangulations
Hamiltonicity and generalised total colourings of planar graphs
Acyclic coloring of graphs with some girth restriction
Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope
Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable
A sufficient condition for planar graphs to be acyclically 5-choosable
Acyclic 5-choosability of planar graphs without adjacent short cycles
Acyclic 4-choosability of planar graphs with girth at least 5
Star coloring of graphs with girth at least five
On some arboricities in planar graphs
Planar graphs without 4-cycles are acyclically 6-choosable
Acyclic list 7‐coloring of planar graphs
Acyclic 4-choosability of planar graphs without intersecting short cycles
A note on acyclic number of planar graphs
Acyclic 6-choosability of planar graphs without adjacent short cycles
Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
A Complexity Dichotomy for the Coloring of Sparse Graphs
Acyclic 5-choosability of planar graphs without 4-cycles
Acyclic 5-choosability of planar graphs without 4-cycles
A polyhedral study of the acyclic coloring problem
Acyclic colouring of 1-planar graphs
Injective edge-coloring of subcubic graphs
Acyclic 4-choosability of planar graphs
Acyclic vertex coloring of graphs of maximum degree 5
k-forested coloring of planar graphs with large girth
Acyclically 3-colorable planar graphs
Computation of certain domination numbers of collaboration 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
\(k\)-forested choosability of planar graphs and sparse graphs
Acyclic colorings of subcubic graphs
Generalised acyclic edge colourings of graphs with large girth
Online coloring graphs with high girth and high odd girth
On acyclic 4-choosability of planar graphs without short cycles

This page was built for publication: Acyclic Colourings of Planar Graphs with Large Girth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3839894)