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

Authors:
Zhidan Yan;Wei Wang
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 13
Cited 0

On the chromatic number of the product of graphs

Journal of Graph Theory
An existential problem of a weight-controlled subset and its application to school timetable construction

Discrete Mathematics - First Japan Conference on Graph Theory and Applications
Equitable coloring of trees

Journal of Combinatorial Theory Series B
Equitable coloring and the maximum degree

European Journal of Combinatorics
Mutual exclusion scheduling

Theoretical Computer Science
Domain decomposition: parallel multilevel methods for elliptic partial differential equations

Domain decomposition: parallel multilevel methods for elliptic partial differential equations
On the equitable chromatic number of complete n-partite graphs

Discrete Applied Mathematics
The infamous upper tail

Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
A short proof of the hajnal–szemerédi theorem on equitable colouring

Combinatorics, Probability and Computing
Equitable list-coloring for graphs of maximum degree 3

Journal of Graph Theory
A note on equitable colorings of forests

European Journal of Combinatorics
Equitable colorings of Kronecker products of graphs

Discrete Applied Mathematics
Equitable colorings of Cartesian products of graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most 1. The equitable chromatic number of a graph G, denoted by @g"=(G), is the minimum k such that G is equitably k-colorable. The equitable chromatic threshold of a graph G, denoted by @g"=^*(G), is the minimum t such that G is equitably k-colorable for k=t. In this paper, we give the exact values of @g"=(K"m"""1","...","m"""rxK"n) and @g"=^*(K"m"""1","...","m"""rxK"n) for @?"i"="1^rm"i@?n.