Acyclic coloring of graphs of maximum degree five: nine colors are enough
From MaRDI portal
Publication:2380043
DOI10.1016/j.ipl.2007.08.022zbMath1183.05027OpenAlexW2052022404WikidataQ56390803 ScholiaQ56390803MaRDI QIDQ2380043
Guillaume Fertin, Andre Raspaud
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.08.022
Related Items (18)
Acyclic choosability of graphs with bounded degree ⋮ Acyclically 4-colorable triangulations ⋮ Acyclic coloring of graphs with maximum degree 7 ⋮ Acyclic coloring of claw-free graphs with small degree ⋮ Acyclic vertex coloring of graphs of maximum degree 5 ⋮ On b-acyclic chromatic number of a graph ⋮ Unnamed Item ⋮ Graphs with maximum degree \(6\) are acyclically \(11\)-colorable ⋮ Acyclic and star colorings of cographs ⋮ Acyclic vertex coloring of graphs of maximum degree six ⋮ Acyclic total colorings of planar graphs without \(l\) cycles ⋮ Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs ⋮ Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6 ⋮ A polyhedral study of the acyclic coloring problem ⋮ Acyclic coloring of graphs and entropy compression method ⋮ Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope ⋮ Acyclic coloring of graphs with maximum degree at most six ⋮ The \(r\)-acyclic chromatic number of planar graphs
Cites Work
- Unnamed Item
- Acyclic colorings of subcubic graphs
- Acyclic colorings of products of trees
- Acyclic and \(k\)-distance coloring of the grid
- On acyclic colorings of planar graphs
- Acyclic Colourings of Planar Graphs with Large Girth
- Acyclic coloring of graphs
- The chromatic number of oriented graphs
- Acyclic colorings of planar graphs
- Acyclic colouring of 1-planar graphs
This page was built for publication: Acyclic coloring of graphs of maximum degree five: nine colors are enough
