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

DOI10.7151/DMGT.1665MaRDI QIDQ2866451zbMATH OpenOpenAlexFDO

Authors Anna Fiedorowicz

Publication date 13 December 2013

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

acyclic colouringbounded degree graphmaximum average degree

Mathematics Subject Classification ID

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

Recommendations

• Graphs with maximum degreee 5 are acyclically 7-colorable
• Acyclic coloring of graphs with maximum degree at most six
• Acyclic coloring of graphs of maximum degree five: nine colors are enough
• Graphs with maximum degree 6 are acyclically 11-colorable
• Acyclic coloring of graphs of maximum degree \(\Delta \)

Cited in

(9)

• Acyclic coloring of graphs with maximum degree 7
• Graphs with maximum degreee 5 are acyclically 7-colorable
• Graphs with maximum degree 6 are acyclically 11-colorable
• Acyclic coloring of graphs and entropy compression method
• Acyclic coloring of claw-free graphs with small degree
• Total-coloring of sparse graphs with maximum degree 6
• Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6
• Acyclic coloring of graphs with maximum degree at most six
• Acyclic vertex coloring of graphs of maximum degree six

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866451)