A note on graphs with prescribed complete coloring numbers

MaRDI QIDQ3581671zbMATH OpenFDO

Authors Gary Chartrand, Futaba Okamoto, Zsolt Tuza, Ping Zhang

Publication date 2 September 2010

zbMATH Keywords

proper coloringGrundy coloringcomplete coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Minimum order of graphs with given coloring parameters
• A four colorings theorem
• On the existence of graphs with prescribed coloring parameters
• Grundy numbers of products of paths, cycles, and stars
• scientific article; zbMATH DE number 4053646

Cited in

(7)

• scientific article; zbMATH DE number 7090175 (Why is no real title available?)
• A four colorings theorem
• A note on the colour class of a self-complementary graph
• A NOTE ON COLOURING OF COMPLETE GRAPHS
• Minimum order of graphs with given coloring parameters
• More results on the \(z\)-chromatic number of graphs
• On the existence of graphs with prescribed coloring parameters

This page was built for publication: A note on graphs with prescribed complete coloring numbers

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