Equitable coloring of Cartesian product of some graphs.

MaRDI QIDQ3134364zbMATHFDO

Authors Shasha Ma, Shaoqiang Zhang, Liancui Zuo

Publication date 9 February 2018

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)

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

Cited in

(13)

• Equitable chromatic threshold of direct products of complete graphs.
• Equitable chromatic number of weak modular product of some graphs
• scientific article; zbMATH DE number 6538114 (Why is no real title available?)
• Equitable colorings of a special class of Cartesian products of graphs
• The equitable colorings of Kneser graphs
• Equitable coloring of graph product
• The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4
• Equitable colorings of Cartesian products of fans with bipartite graphs
• Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
• Equitable colorings of Kronecker products of graphs
• Equitable distinguishing chromatic number
• Equitable colorings of Cartesian products with balanced complete multipartite graphs
• Equitable colorings of Cartesian products of 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)