A note on Grundy colorings of central graphs

MaRDI QIDQ4595236zbMATH OpenFDO

Authors Brice Effantin

Publication date 29 November 2017

Full work available at URL http://ajc.maths.uq.edu.au/pdf/68/ajc_v68_p346.pdf

zbMATH Keywords

Nordhaus-Gaddum inequality

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• More bounds for the Grundy number of graphs
• Grundy numbers of products of paths, cycles, and stars
• Grundy numbers of strong products of graphs
• Grundy number of graphs
• Results on the Grundy chromatic number of graphs

Cited in

(4)

• Transitivity on subclasses of bipartite graphs
• Algorithmic study of \(d_2\)-transitivity of graphs
• On b-coloring of central graph of some graphs
• Algorithmic study on 2-transitivity of graphs

This page was built for publication: A note on Grundy colorings of central graphs

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