Acyclic Choosability of Graphs with Small Maximum Degree

@inproceedings{Gonalves2005AcyclicCO,
  title={Acyclic Choosability of Graphs with Small Maximum Degree},
  author={Daniel Gonçalves and Micka{\"e}l Montassier},
  booktitle={WG},
  year={2005}
}
A proper vertex coloring of a graph G = (V,E) is acyclic if G contains no bicolored cycle. A graph G is L-list colorable if for a given list assignment L = {L(v) : v ∈ V}, there exists a proper coloring c of G such that c(v) ∈ L(v) for all v ∈ V. If G is L-list colorable for every list assignment with |L(v)| ≥ k for all v ∈ V, then G is said k-choosable. A graph is said to be acyclically k-choosable if the coloring obtained is acyclic. In this paper, we study the acyclic choosability of graphs… 
Acyclic improper choosability of subcubic graphs
Acyclic improper choosability of graphs
RR-1423-07 Acyclic t-improper colourings of graphs with bounded maximum degree
For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour classes is acyclic and
A conjecture of Borodin and a coloring of Grünbaum
TLDR
It is proved that every planar graph has a 5-coloring such that the union of every k color classes with 1 ⩽ k⩽ 4 induces a k-degenerate graph.
Acyclic Choosability of Graphs with Bounded Degree

References

SHOWING 1-10 OF 15 REFERENCES
On the acyclic choosability of graphs
TLDR
The links between acyclick-choosability of G and Mad(G) defined as the maximum average degree of the subgraphs of G are studied and some observations about the relationship between a cyclic coloring, choosability and acyclic choosable are given.
List colourings of planar graphs
ACYCLIC COLOURINGS OF PLANAR GRAPHS WITH LARGE GIRTH
A proper vertex‐colouring of a graph is acyclic if there are no 2‐coloured cycles. It is known that every planar graph is acyclically 5‐colourable, and that there are planar graphs with acyclic
Acyclic colorings of planar graphs
A coloring of the vertices of a graph byk colors is called acyclic provided that no circuit is bichromatic. We prove that every planar graph has an acyclic coloring with nine colors, and conjecture
Every planar graph has an acyclic 7-coloring
A proper coloring of the vertices of a graph is said to be acyclic provided that no cycle is two colored. We prove that every planar graph has an acyclic seven coloring.
Acyclic list 7‐coloring of planar graphs
The acyclic list chromatic number of every planar graph is proved to be at most 7. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 83–90, 2002
Every Planar Graph Is 5-Choosable
We prove the statement of the title, which was conjectured in 1975 by V. G. Vizing and, independently, in 1979 by P. Erdos, A. L. Rubin, and H Taylor.
Negative results on acyclic improper colorings
This invention relates to an improved bottom block for vertical DC and EM casting large ingots and billets, particularly ingots having generally rectangularly shaped cross sections which are rolled
...
...