Acyclic vertex coloring of graphs of maximum degree six

DOI10.1016/J.ENDM.2009.11.030MaRDI QIDQ2840537zbMATH OpenOpenAlexDBLPWikidataFDO

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

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

analysis of algorithmsgraph theory

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites work

• Acyclic coloring of graphs
• Acyclic coloring of graphs of maximum degree
• Acyclic colorings of planar graphs
• Acyclic colorings of subcubic graphs
• Acyclic vertex coloring of graphs of maximum degree 5
• Acyclic vertex coloring of graphs of maximum degree six
• Coloring with no 2-colored \(P_4\)'s
• scientific article; zbMATH DE number 3536120 (Why is no real title available?)
• scientific article; zbMATH DE number 3616457 (Why is no real title available?)
• On acyclic colorings of planar graphs

Cited in

(8)

• Graphs with maximum degree 6 are acyclically 11-colorable
• Acyclic coloring of claw-free graphs with small degree
• Acyclic coloring of graphs and entropy compression method
• Acyclic coloring of graphs with maximum degree at most six
• The \(r\)-acyclic chromatic number of planar graphs
• Acyclic vertex coloring of graphs of maximum degree six
• Acyclic coloring of graphs with maximum degree 7
• Acyclic vertex coloring of graphs of maximum degree six

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

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