A note on graphs with prescribed complete coloring numbers

zbMATH Open1198.05042MaRDI QIDQ3581671FDOQ3581671

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

Publication date: 2 September 2010

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

zbMATH Keywords

proper coloringGrundy coloringcomplete coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (7)

• Title not available (Why is that?)
• 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)