Chromatic number for a generalization of Cartesian product graphs.
Král', Daniel, West, Douglas B. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Bipartite coverings and the chromatic number.”
Chromatic number for a generalization of Cartesian product graphs.
On the chromatic number of simple triangle-free triple systems.
Frieze, Alan, Mubayi, Dhruv (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Broken-cycle-free subgraphs and the log-concavity conjecture for chromatic polynomials.
Lundow, P.H., Markström, K. (2006)
Experimental Mathematics
Similarity:
Precoloring extension. II. Graphs classes related to bipartite graphs.
Hujter, M., Tuza, Zs. (1993)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Ramseyan properties of graphs.
DeLaVina, Ermelinda, Fajtlowicz, Siemion (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Nonrepetitive colorings of graphs -- a survey.
Grytczuk, Jarosław (2007)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Guessing secrets.
Chung, Fan, Graham, Ronald, Leighton, Tom (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold.
Cooper, Colin, Frieze, Alan (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Approximations of weighted independent set and hereditary subset problems.
Halldórsson, Magnús M. (2000)
Journal of Graph Algorithms and Applications
Similarity:
On classes of graphs determined by forbidden subgraphs
Svatopluk Poljak, Vojtěch Rödl (1983)
Czechoslovak Mathematical Journal
Similarity:
Equitable coloring of Kneser graphs
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)...