A new bound on the acyclic edge chromatic index
Combinatorics
2019-12-11 v1
Abstract
In this note we obtain a new bound for the acyclic edge chromatic number of a graph with maximum degree proving that . To get this result we revisit and slightly modify the method described in [Giotis, Kirousis, Psaromiligkos and Thilikos, Theoretical Computer Science, 66: 40-50, 2017].
Keywords
Cite
@article{arxiv.1912.04436,
title = {A new bound on the acyclic edge chromatic index},
author = {Paula M. S. Fialho and Bernardo N. B. de Lima and Aldo Procacci},
journal= {arXiv preprint arXiv:1912.04436},
year = {2019}
}