An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs

@inproceedings{Mcajov2011AnAF,
title={An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs},
author={Edita M{\'a}cajov{\'a} and J{\'a}n Maz{\'a}k},
booktitle={FAW-AAIM},
year={2011}
}
• Published in FAW-AAIM 28 May 2011
• Mathematics
Anacyclic edge-colouring of a graph is a proper edge-colouring such that the subgraph induced by the edges of any two colours is acyclic. The acyclic chromatic index of a graph G is the smallest possible number of colours in an acyclic edge-colouring of G. In [12], we have shown that the acyclic chromatic index of a connected subcubic graph G is at most 4 with the exception of K4 and K3,3, for which five colors are optimal. Here we give a quadratic-time algorithm that finds an acyclic 4-edge…
2 Citations

References

SHOWING 1-10 OF 13 REFERENCES

Algorithmic Aspects of Acyclic Edge Colorings

• Mathematics
Algorithmica
• 2001
It is proved that determining the acyclic edge chromatic number of an arbitrary graph is an NP-complete problem and present deterministic polynomial-time algorithms that color the edges of G acYclically using at most Δ(G)+2 colors.

The acyclic edge chromatic number of a random d-regular graph is d + 1

• Mathematics
• 2005
We prove the theorem from the title: the acyclic edge chromatic number of a random d-regular graph is asymptotically almost surely equal to d + 1. This improves a result of Alon, Sudakov, and Zaks

Acyclic edge colorings of graphs

• Mathematics
J. Graph Theory
• 2001
The acyclic edge chromatic number of G, denoted by a0(G), is the least number of colors in a proper coloring of the edges of a graph G if there is no 2-colored cycle in G.

Acyclic Coloring of Graphs

• Mathematics
Random Struct. Algorithms
• 1991
It is shown that if G has maximum degree d, then A(G) = 0(d4/3) as d → ∞, which settles a problem of Erdos who conjectured, in 1976, that A( G) = o(d2) as d →∞.

New Acyclic and Star Coloring Algorithms with Application to Computing Hessians

• Computer Science
SIAM J. Sci. Comput.
• 2007
To the best of the knowledge, this work is the first practical algorithm for the acyclic coloring problem and is considerably faster than a previously known $O(n\overline{d}_3)$-time algorithm.

Further algorithmic aspects of the local lemma

• Computer Science
STOC '98
• 1998
This is the author's version of the work and it is posted here by permission of ACM for your personal use.

Introduction to Algorithms

• Computer Science
• 1990
The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.