Improved upper bound for generalized acyclic chromatic number of graphs
type: Item
instance of: scholarly article
title: Improved upper bound for generalized acyclic chromatic number of graphs
zbMATH Open document ID: 1402.05059
author: Jiansheng Cai
author: Xuding Zhu
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 2018-11-07T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6974667
zbMATH Keywords: girth
zbMATH Keywords: coloring
zbMATH Keywords: acyclic coloring
zbMATH Keywords: \(r\)-acyclic coloring
zbMATH Keywords: lopsided local lemma
MaRDI profile type: Publication
full work available at URL: s10255-018-0791-5
OpenAlex ID: W2895064810
cites work: Acyclic coloring of graphs
cites work: Q3097395
cites work: The generalized acyclic chromatic number of graphs with large girth
cites work: Lopsided Lovász Local lemma and Latin transversals
cites work: Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
cites work: Graph colouring and the probabilistic method
cites work: Highly nonrepetitive sequences: Winning strategies from the local lemma
DOI: 10.1007/S10255-018-0791-5
description: scientific article; zbMATH DE number 6974667