Generalized acyclic edge colorings via entropy compression

DOI10.1007/s10878-017-0244-8zbMath1393.05113OpenAlexW2781740686MaRDI QIDQ1743494

Guang-Hui Wang, Lai-hao Ding, Jian Liang Wu

Publication date: 13 April 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0244-8

zbMATH Keywords

list coloring\(r\)-acyclic edge coloringlarge girthentropy compression

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Edge-coloring of plane multigraphs with many colors on facial cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New bounds for the acyclic chromatic index
• A note on acyclic vertex-colorings
• Improved bounds on coloring of graphs
• Generalised acyclic edge colourings of graphs with large girth
• Acyclic edge-coloring using entropy compression
• Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
• Acyclic edge colorings of graphs
• The generalized acyclic edge chromatic number of random regular graphs
• A constructive proof of the general lovász local lemma
• Acyclic coloring of graphs
• The acyclic edge chromatic number of a random d‐regular graph is d + 1
• Acyclic edge colourings of graphs with large girth
• On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring

This page was built for publication: Generalized acyclic edge colorings via entropy compression