A new bound on the acyclic edge chromatic index
Abstract
In this note we obtain a new bound for the acyclic edge chromatic number a'(G) of a graph G with maximum degree D proving that a'(G)≤ 3.569(D-1). 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].
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.