Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs

DOI10.1016/j.dam.2013.08.042zbMath1297.05094arXiv1210.0188OpenAlexW2035176773MaRDI QIDQ741756

Zhidan Yan, Wei Wang

Publication date: 12 September 2014

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

Full work available at URL: https://arxiv.org/abs/1210.0188

zbMATH Keywords

Kronecker productcomplete multipartite graphequitable coloringequitable chromatic threshold

Mathematics Subject Classification ID

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

Related Items

Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs ⋮ Equitable coloring and equitable choosability of graphs with small maximum average degree ⋮ On \(r\)-equitable chromatic threshold of Kronecker products of complete graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equitable colorings of Kronecker products of graphs
• Equitable colorings of Cartesian products of graphs
• A note on equitable colorings of forests
• An existential problem of a weight-controlled subset and its application to school timetable construction
• Equitable coloring of trees
• Equitable coloring and the maximum degree
• Mutual exclusion scheduling
• A survey on Hedetniemi's conjecture
• Equitable chromatic number of complete multipartite graphs
• Equitable colorings of outerplanar graphs
• Equitable list-coloring for graphs of maximum degree 3
• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
• On the chromatic number of the product of graphs
• Equitable Coloring
• The infamous upper tail
• Perfect Graphs and an Application to Optimizing Municipal Services
• On the equitable chromatic number of complete \(n\)-partite graphs

This page was built for publication: Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs