A new bound on the acyclic edge chromatic number
From MaRDI portal
Publication:2198378
Recommendations
Cites work
- scientific article; zbMATH DE number 3603300 (Why is no real title available?)
- scientific article; zbMATH DE number 1775440 (Why is no real title available?)
- A constructive proof of the Lovász local lemma
- A constructive proof of the general Lovász local lemma
- Acyclic coloring of graphs
- Acyclic edge coloring through the Lovász local lemma
- Acyclic edge colorings of graphs
- Acyclic edge colourings of graphs with large girth
- Acyclic edge-coloring using entropy compression
- An improvement of the Lovász local lemma via cluster expansion
- Analytic combinatorics
- Improved bounds on coloring of graphs
- New bounds for the acyclic chromatic index
- Nonrepetitive colouring via entropy compression
- On the facial Thue choice index via entropy compression
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
- A note on acyclic vertex-colorings
- Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
- 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)