Acyclic edge colourings of graphs with large girth

DOI10.1002/rsa.20695zbMath1368.05045arXiv1411.3047OpenAlexW3102818319MaRDI QIDQ4978429

Adam Bene Watts, Xing Shi Cai, Guillem Perarnau, Bruce A. Reed

Publication date: 10 August 2017

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.3047

zbMATH Keywords

bounded degree graphsacyclic edge coloringssemirandom method

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (3)

New bounds for the acyclic chromatic index ⋮ A new bound on the acyclic edge chromatic number ⋮ Generalized acyclic edge colorings via entropy compression

Cites Work

• New bounds for the acyclic chromatic index
• Improved bounds on coloring of graphs
• Asymptotically good list-colorings
• Acyclic edge-coloring using entropy compression
• Improved bounds on acyclic edge colouring
• 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
• Models and thresholds for random constraint satisfaction problems
• Acyclic coloring of graphs
• Near-optimal list colorings
• Acyclic colorings of planar graphs

This page was built for publication: Acyclic edge colourings of graphs with large girth