Equitable colorings of Cartesian products with balanced complete multipartite graphs

DOI10.1016/J.DAM.2014.08.021zbMATH Open1303.05071OpenAlexW2090681852MaRDI QIDQ476328FDOQ476328

Authors: Zhidan Yan, Wei Wang, Xin Zhang 

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

Recommendations

• The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4
• Equitable colorings of Cartesian products of graphs
• Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs
• Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
• Equitable coloring of Cartesian product of some graphs.

zbMATH Keywords

equitable coloringCartesian productequitable chromatic numberbalanced complete multipartite graph

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Equitable critical graphs
• Equitable coloring of graph product
• Title not available (Why is that?)
• Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs
• Equitable colorings of Cartesian products of graphs
• Equitable colorings of line graphs and complete \(r\)-partite graphs

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

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