Acyclic Vertex Coloring of Graphs of Maximum Degree Six

DOI10.1016/j.endm.2009.11.030zbMath1268.05086OpenAlexW2179060914WikidataQ56390819 ScholiaQ56390819MaRDI QIDQ2840537

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

Publication date: 19 July 2013

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

Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.030

zbMATH Keywords

graph theoryanalysis of algorithms

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Acyclic coloring of graphs with maximum degree 7 ⋮ Acyclic coloring of claw-free graphs with small degree ⋮ Graphs with maximum degree \(6\) are acyclically \(11\)-colorable ⋮ Acyclic vertex coloring of graphs of maximum degree six ⋮ 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 ⋮ The \(r\)-acyclic chromatic number of planar graphs

Cites Work

• Acyclic vertex coloring of graphs of maximum degree 5
• Acyclic colorings of subcubic graphs
• On acyclic colorings of planar graphs
• Coloring with no 2-colored \(P_4\)'s
• Acyclic Vertex Coloring of Graphs of Maximum Degree Six
• Acyclic coloring of graphs
• Acyclic colorings of planar graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Acyclic Vertex Coloring of Graphs of Maximum Degree Six