Equitable colorings of Cartesian products with balanced complete multipartite graphs

DOI10.1016/j.dam.2014.08.021zbMath1303.05071OpenAlexW2090681852MaRDI QIDQ476328

Zhidan Yan, Xin Zhang, Wei Wang

Publication date: 28 November 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.08.021

zbMATH Keywords

Cartesian productequitable chromatic numberequitable coloringbalanced complete multipartite graph

Mathematics Subject Classification ID

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

Related Items (1)

Equitable critical graphs

Cites Work

• Unnamed Item
• The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4
• Equitable colorings of Cartesian products of graphs
• Graphs with Given Group and Given Graph-Theoretical Properties
• Equitable Coloring
• Handbook of Combinatorial Optimization

This page was built for publication: Equitable colorings of Cartesian products with balanced complete multipartite graphs