The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4

DOI10.11650/TJM.18.2014.3645zbMATH Open1357.05047OpenAlexW2026668745MaRDI QIDQ514702FDOQ514702

Authors: Zhidan Yan, Wu-Hsiung Lin, Wei Wang 

Publication date: 9 March 2017

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/tjm.18.2014.3645

Recommendations

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

zbMATH Keywords

bipartite graphequitable coloringCartesian productequitable chromatic threshold

Mathematics Subject Classification ID

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

Cited In (2)

• Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
• Equitable colorings of Cartesian products with balanced complete multipartite graphs

This page was built for publication: The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4

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