A new bound on the acyclic edge chromatic number

A new bound on the acyclic edge chromatic number

In this note we obtain a new bound for the acyclic edge chromatic number a′(G) of a graph G with maximum degree Δ proving that a′(G)≤3.569(Δ−1). To get this result we revisit and slightly modify the method described in Kirousis et al. (2017).

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete mathematics 2020-11, Vol.343 (11), p.112037, Article 112037
Hauptverfasser: Fialho, Paula M.S., de Lima, Bernardo N.B., Procacci, Aldo
Format: Artikel
Sprache:eng
Schlagworte:
Lovász local lemma
Probabilistic method in combinatorics
Randomized algorithms
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this note we obtain a new bound for the acyclic edge chromatic number a′(G) of a graph G with maximum degree Δ proving that a′(G)≤3.569(Δ−1). To get this result we revisit and slightly modify the method described in Kirousis et al. (2017).
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2020.112037