Acyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree

DOI10.7151/dmgt.1665zbMath1291.05061OpenAlexW2080036623MaRDI QIDQ2866451

Anna Fiedorowicz

Publication date: 13 December 2013

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1665

zbMATH Keywords

bounded degree graphmaximum average degreeacyclic colouring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (5)

Acyclic coloring of graphs with maximum degree 7 ⋮ Acyclic coloring of claw-free graphs with small degree ⋮ Acyclic vertex coloring of graphs of maximum degree six ⋮ Acyclic coloring of graphs and entropy compression method ⋮ Acyclic coloring of graphs with maximum degree at most six

This page was built for publication: Acyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree