Generalized acyclic edge colorings via entropy compression
type: Item
instance of: scholarly article
title: Generalized acyclic edge colorings via entropy compression
zbMATH Open document ID: 1393.05113
published in: Journal of Combinatorial Optimization
publication date: 2018-04-13T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6859595
zbMATH Keywords: \(r\)-acyclic edge coloring
zbMATH Keywords: entropy compression
zbMATH Keywords: list coloring
zbMATH Keywords: large girth
author: Lai-hao Ding
author: Guanghui Wang
author: Jian-Liang Wu
MaRDI profile type: Publication
full work available at URL: s10878-017-0244-8
OpenAlex ID: W2781740686
cites work: Acyclic coloring of graphs
cites work: Acyclic edge colorings of graphs
cites work: New bounds for the acyclic chromatic index
cites work: Acyclic edge colourings of graphs with large girth
cites work: Acyclic edge-coloring using entropy compression
cites work: Q5315023
cites work: The generalized acyclic edge chromatic number of random regular graphs
cites work: Generalised acyclic edge colourings of graphs with large girth
cites work: On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring
cites work: Improved bounds on coloring of graphs
cites work: Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
cites work: Q4542572
cites work: A constructive proof of the general lovász local lemma
cites work: The acyclic edge chromatic number of a random d‐regular graph is d + 1
cites work: On the Facial Thue Choice Index via Entropy Compression
cites work: A note on acyclic vertex-colorings
DOI: 10.1007/S10878-017-0244-8
description: scientific article; zbMATH DE number 6859595