Improved bounds for acyclic coloring parameters

by   Lefteris Kirousis, et al.

The acyclic chromatic number of a graph is the least number of colors needed to properly color its vertices so that none of its cycles has only two colors. The acyclic chromatic index is the analogous graph parameter for edge colorings. We first show that the acyclic chromatic index is at most 2Δ-1, where Δ is the maximum degree of the graph. We then show that for all ϵ >0 and for Δ large enough (depending on ϵ), the acyclic chromatic number of the graph is at most ⌈(2^-1/3 +ϵ) Δ^4/3⌉ +Δ+ 1. Both results improve long chains of previous successive advances. Both are algorithmic, in the sense that the colorings are generated by randomized algorithms. However, in contrast with extant approaches, where the randomized algorithms assume the availability of enough colors to guarantee properness deterministically, and use additional colors for randomization in dealing with the bichromatic cycles, our algorithms may initially generate colorings that are not necessarily proper; they only aim at avoiding cycles where all pairs of edges, or vertices, that are one edge, or vertex, apart in a traversal of the cycle are homochromatic (of the same color). When this goal is reached, they check for properness and if necessary they repeat until properness is attained.


page 1

page 2

page 3

page 4


Upper Bounds on the Acyclic Chromatic Index of Degenerate Graphs

An acyclic edge coloring of a graph is a proper edge coloring without an...

Acyclic Chromatic Index of Chordless Graphs

An acyclic edge coloring of a graph is a proper edge coloring in which t...

Improved Approximation Algorithms for Weighted Edge Coloring of Graphs

We study weighted edge coloring of graphs, where we are given an undirec...

Rainbow cycles for families of matchings

Given a graph G and a coloring of its edges, a subgraph of G is called r...

Fewer colors for perfect simulation of proper colorings

Given a graph G and color set {1, …, k}, a proper coloring is an assignm...

Accessible Color Cycles for Data Visualization

Color cycles, ordered sets of colors for data visualization, that balanc...

Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints

We consider acyclic r-colorings in graphs and digraphs: they color the v...

Please sign up or login with your details

Forgot password? Click here to reset