On subgraphs induced by transversals in vertex-partitions of graphs.
Axenovich, Maria (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Avoiding rainbow induced subgraphs in vertex-colorings.”
On subgraphs induced by transversals in vertex-partitions of graphs.
A note on graph coloring extensions and list-colorings.
Axenovich, Maria (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The order of monochromatic subgraphs with a given minimum degree.
Caro, Yair, Yuster, Raphael (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Star coloring high girth planar graphs.
Timmons, Craig (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rainbow -factors.
Yuster, Raphael (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Computation of the vertex Folkman numbers and .
Nedialkov, Evgeni, Nenov, Nedyalko (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
-free graphs of large minimum degree.
Alon, Noga, Sudakov, Benny (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Zero-sum partition theorems for graphs.
Caro, Y., Krasikov, I., Roditty, Y. (1994)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The distinguishing chromatic number.
Collins, Karen L., Trenk, Ann N. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A Tight Bound on the Set Chromatic Number
Jean-Sébastien Sereni, Zelealem B. Yilma (2013)
Discussiones Mathematicae Graph Theory
Similarity:
We provide a tight bound on the set chromatic number of a graph in terms of its chromatic number. Namely, for all graphs G, we show that χs(G) > ⌈log2 χ(G)⌉ + 1, where χs(G) and χ(G) are the set chromatic number and the chromatic number of G, respectively. This answers in the affirmative a conjecture of Gera, Okamoto, Rasmussen and Zhang.