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

DOI10.11650/tjm.18.2014.3645zbMath1357.05047OpenAlexW2026668745MaRDI QIDQ514702

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

zbMATH Keywords

bipartite graphCartesian productequitable coloringequitable chromatic threshold

Mathematics Subject Classification ID

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

Related Items (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