Chromatic number for a generalization of Cartesian product graphs.
Král', Daniel, West, Douglas B. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Král', Daniel, West, Douglas B. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Frieze, Alan, Mubayi, Dhruv (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lundow, P.H., Markström, K. (2006)
Experimental Mathematics
Similarity:
Hujter, M., Tuza, Zs. (1993)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
DeLaVina, Ermelinda, Fajtlowicz, Siemion (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Grytczuk, Jarosław (2007)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Chung, Fan, Graham, Ronald, Leighton, Tom (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cooper, Colin, Frieze, Alan (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Halldórsson, Magnús M. (2000)
Journal of Graph Algorithms and Applications
Similarity:
Svatopluk Poljak, Vojtěch Rödl (1983)
Czechoslovak Mathematical Journal
Similarity:
Robert Fidytek, Hanna Furmańczyk, Paweł Żyliński (2009)
Discussiones Mathematicae Graph Theory
Similarity:
The Kneser graph K(n,k) is the graph whose vertices correspond to k-element subsets of set {1,2,...,n} and two vertices are adjacent if and only if they represent disjoint subsets. In this paper we study the problem of equitable coloring of Kneser graphs, namely, we establish the equitable chromatic number for graphs K(n,2) and K(n,3). In addition, for sufficiently large n, a tight upper bound on equitable chromatic number of graph K(n,k) is given. Finally, the cases of K(2k,k) and K(2k+1,k)...
Tomáš Vetrík (2012)
Discussiones Mathematicae Graph Theory
Similarity:
The choice number of a graph G is the smallest integer k such that for every assignment of a list L(v) of k colors to each vertex v of G, there is a proper coloring of G that assigns to each vertex v a color from L(v). We present upper and lower bounds on the choice number of complete multipartite graphs with partite classes of equal sizes and complete r-partite graphs with r-1 partite classes of order two.