A new bound on the acyclic edge chromatic number

DOI10.1016/j.disc.2020.112037zbMath1447.05078OpenAlexW3037052206MaRDI QIDQ2198378

Aldo Procacci, Paula Mendes Soares Fialho, Bernardo Nunes Borges de Lima

Publication date: 10 September 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2020.112037

zbMATH Keywords

randomized algorithmsLovász local lemmaprobabilistic method in combinatorics

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Randomized algorithms (68W20)

Related Items (3)

Upper bounds on the acyclic chromatic index of degenerate graphs ⋮ Moser-Tardos resampling algorithm, entropy compression method and the subset gas ⋮ Entropy compression versus Lovász local lemma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New bounds for the acyclic chromatic index
• Improved bounds on coloring of graphs
• Acyclic edge coloring through the Lovász local lemma
• Nonrepetitive colouring via entropy compression
• Acyclic edge-coloring using entropy compression
• Acyclic edge colorings of graphs
• An Improvement of the Lovász Local Lemma via Cluster Expansion
• A constructive proof of the general lovász local lemma
• Acyclic coloring of graphs
• Acyclic edge colourings of graphs with large girth
• A constructive proof of the Lovász local lemma

This page was built for publication: A new bound on the acyclic edge chromatic number