Acyclic colorings of graphs with bounded degree

DOI10.1007/s11425-016-5126-5zbMath1347.05062arXiv1511.04207MaRDI QIDQ310229

Mieczysław Borowiecki, Elżbieta Sidorowicz, Anna Fiedorowicz, Katarzyna Jesse-Józefczyk

Publication date: 8 September 2016

Published in: Science China. Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

computational complexity; acyclic coloring; subcubic graph; bounded degree graph; acyclic colouring

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C15: Coloring of graphs and hypergraphs

05C85: Graph algorithms (graph-theoretic aspects)