Acyclic vertex coloring of graphs of maximum degree 5

DOI10.1016/j.disc.2010.10.024zbMath1222.05077OpenAlexW2116274809MaRDI QIDQ626789

Kishore Yadav, V. Ch. Venkaiah, Satish Varagani, Kishore Kothapalli

Publication date: 18 February 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.10.024

zbMATH Keywords

algorithmsgraph coloringbounded degree graphsacyclic coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

Acyclic coloring of graphs with maximum degree 7 ⋮ Acyclic coloring of claw-free graphs with small degree ⋮ On b-acyclic chromatic number of a graph ⋮ Graphs with maximum degree \(6\) are acyclically \(11\)-colorable ⋮ Acyclic vertex coloring of graphs of maximum degree six ⋮ Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6 ⋮ Acyclic coloring of graphs and entropy compression method ⋮ Acyclic Vertex Coloring of Graphs of Maximum Degree Six ⋮ Acyclic coloring of graphs with maximum degree at most six

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Acyclic colorings of subcubic graphs
• Acyclic and \(k\)-distance coloring of the grid
• On acyclic colorings of planar graphs
• Coloring with no 2-colored \(P_4\)'s
• Acyclic coloring of graphs of maximum degree five: nine colors are enough
• Acyclic edge colorings of graphs
• Acyclic Colourings of Planar Graphs with Large Girth
• Acyclic coloring of graphs
• An algorithmic approach to the Lovász local lemma. I
• The chromatic number of oriented graphs
• Acyclic list 7‐coloring of planar graphs
• Acyclic colorings of planar graphs

This page was built for publication: Acyclic vertex coloring of graphs of maximum degree 5