A new bound on the acyclic edge chromatic number
From MaRDI portal
Publication:2198378
DOI10.1016/J.DISC.2020.112037zbMATH Open1447.05078OpenAlexW3037052206MaRDI QIDQ2198378FDOQ2198378
Authors: Paula Mendes Soares Fialho, Aldo Procacci, 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
Recommendations
Cites Work
- Analytic combinatorics
- Acyclic edge colorings of graphs
- Acyclic coloring of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Acyclic edge-coloring using entropy compression
- On the facial Thue choice index via entropy compression
- New bounds for the acyclic chromatic index
- An improvement of the Lovász local lemma via cluster expansion
- A constructive proof of the general Lovász local lemma
- Improved bounds on coloring of graphs
- Acyclic edge colourings of graphs with large girth
- Nonrepetitive colouring via entropy compression
- A constructive proof of the Lovász local lemma
- Acyclic edge coloring through the Lovász local lemma
Cited In (7)
- Improved upper bounds on acyclic edge colorings
- Entropy compression versus Lovász local lemma
- Upper bounds on the acyclic chromatic index of degenerate graphs
- Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
- A note on acyclic vertex-colorings
- A new upper bound on the acyclic chromatic indices of planar graphs
- Moser-Tardos resampling algorithm, entropy compression method and the subset gas
This page was built for publication: A new bound on the acyclic edge chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198378)
