Acyclic colorings of planar graphs

Related Items (25)

The vertex linear arboricity of distance graphs ⋮ Path choosability of planar graphs ⋮ Facial incidence colorings of embedded multigraphs ⋮ Grid representations and the chromatic number ⋮ Colorings of plane graphs without long monochromatic facial paths ⋮ Some recent progress and applications in graph minor theory ⋮ Parallel complexity of partitioning a planar graph into vertex-induced forests ⋮ Reprint of: ``Grid representations and the chromatic number ⋮ Partitioning sparse graphs into an independent set and a graph with bounded size components ⋮ Maximum induced forests in graphs of bounded treewidth ⋮ Path partition of planar graphs with girth at least six ⋮ Vertex-arboricity of planar graphs without intersecting triangles ⋮ NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems ⋮ Drawing Graphs on Few Lines and Few Planes ⋮ Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable ⋮ On \(S\)-packing edge-colorings of cubic graphs ⋮ Efficient algorithms for acyclic colorings of graphs ⋮ WORM colorings of planar graphs ⋮ On vertex partitions and some minor-monotone graph parameters ⋮ Chromatic sums for colorings avoiding monochromatic subgraphs ⋮ Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles ⋮ Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths ⋮ Proper coloring of geometric hypergraphs ⋮ On Vertex Partitions and the Colin de Verdière Parameter ⋮ An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem

Cites Work

This page was built for publication: Acyclic colorings of planar graphs