Equitable coloring of Cartesian product of some graphs.

zbMATH Open1463.05214MaRDI QIDQ3134364FDOQ3134364

Authors: Shasha Ma, Shaoqiang Zhang, Liancui Zuo 

Publication date: 9 February 2018

Recommendations

• Equitable colorings of Cartesian products of graphs
• Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
• Equitable coloring of graph product
• Equitable colorings of Kronecker products of graphs
• Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs

zbMATH Keywords

equitable coloringCartesian productequitable chromatic numberequitable chromatic threshold

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cited In (13)

• Equitable chromatic number of weak modular product of some graphs
• Equitable colorings of Kronecker products of graphs
• Equitable coloring of graph product
• Equitable chromatic threshold of direct products of complete graphs.
• Equitable distinguishing chromatic number
• Title not available (Why is that?)
• Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
• The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4
• Equitable colorings of Cartesian products with balanced complete multipartite graphs
• Equitable colorings of Cartesian products of graphs
• Equitable colorings of a special class of Cartesian products of graphs
• The equitable colorings of Kneser graphs
• Equitable colorings of Cartesian products of fans with bipartite graphs

This page was built for publication: Equitable coloring of Cartesian product of some graphs.

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