Acyclic edge-coloring using entropy compression
From MaRDI portal
Publication:2444732
DOI10.1016/j.ejc.2013.02.007zbMath1285.05056arXiv1206.1535OpenAlexW2066616484MaRDI QIDQ2444732
Publication date: 11 April 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.1535
Related Items (42)
New bounds for the acyclic chromatic index ⋮ The list chromatic number of graphs with small clique number ⋮ \((2+\epsilon )\)-nonrepetitive list colouring of paths ⋮ Local conditions for planar graphs of acyclic edge coloring ⋮ Acyclic chromatic index of triangle-free 1-planar graphs ⋮ Improved upper bound for the degenerate and star chromatic numbers of graphs ⋮ A General Framework for Hypergraph Coloring ⋮ Acyclic coloring of graphs without bichromatic long path ⋮ Counting colorings of triangle-free graphs ⋮ Application of entropy compression in pattern avoidance ⋮ Acyclic edge coloring of 1-planar graphs without 4-cycles ⋮ Another approach to non-repetitive colorings of graphs of bounded degree ⋮ A new bound on the acyclic edge chromatic number ⋮ Edge colorings avoiding patterns ⋮ On triangle-free list assignments ⋮ Moser-Tardos resampling algorithm, entropy compression method and the subset gas ⋮ Further result on acyclic chromatic index of planar graphs ⋮ Acyclic edge coloring of graphs ⋮ Acyclic edge coloring of 4-regular graphs without 3-cycles ⋮ The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle ⋮ Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture ⋮ Generalized arboricity of graphs with large girth ⋮ Unnamed Item ⋮ Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle ⋮ Generalized acyclic edge colorings via entropy compression ⋮ Acyclic edge coloring through the Lovász local lemma ⋮ Nonrepetitive colouring via entropy compression ⋮ An upper bound for the choice number of star edge coloring of graphs ⋮ Entropy compression versus Lovász local lemma ⋮ Acyclic edge coloring of 4-regular graphs. II. ⋮ On acyclic edge-coloring of complete bipartite graphs ⋮ Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles ⋮ Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles ⋮ An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles ⋮ Coloring graphs without bichromatic cycles or paths ⋮ Acyclic coloring of graphs and entropy compression method ⋮ Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas ⋮ Acyclic edge coloring of chordal graphs with bounded degree ⋮ Acyclic edge colourings of graphs with large girth ⋮ Counting Gallai 3-colorings of complete graphs ⋮ A Local Lemma for Focused Stochastic Algorithms ⋮ The local cut lemma
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved bounds on coloring of graphs
- Nonrepetitive colouring via entropy compression
- The complexity of nonrepetitive coloring
- Improved bounds on acyclic edge colouring
- Acyclic edge colorings of graphs
- An Improvement of the Lovász Local Lemma via Cluster Expansion
- Star coloring of graphs
- A constructive proof of the general lovász local lemma
- Acyclic coloring of graphs
- New approach to nonrepetitive sequences
- A constructive proof of the Lovász local lemma
- New Constructive Aspects of the Lovász Local Lemma
This page was built for publication: Acyclic edge-coloring using entropy compression
