Avoiding rainbow induced subgraphs in vertex-colorings.
Axenovich, Maria, Martin, Ryan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Axenovich, Maria, Martin, Ryan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Caro, Yair, Yuster, Raphael (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Yuster, Raphael (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Alon, Noga, Sudakov, Benny (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Axenovich, Maria (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Axenovich, Maria (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Allen, Peter (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hosseini Dolama, Mohammad, Sopena, Eric (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Lazebnik, Felix, Tofts, Spencer (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Wayne Goddard, Honghai Xu (2016)
Discussiones Mathematicae Graph Theory
Similarity:
Given a coloring of the vertices of a graph G, we say a subgraph is rainbow if its vertices receive distinct colors. For a graph F, we define the F-upper chromatic number of G as the maximum number of colors that can be used to color the vertices of G such that there is no rainbow copy of F. We present some results on this parameter for certain graph classes. The focus is on the case that F is a star or triangle. For example, we show that the K3-upper chromatic number of any maximal...
Nedialkov, Evgeni, Nenov, Nedyalko (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Caro, Y., Krasikov, I., Roditty, Y. (1994)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Norine, Serguei, Zhu, Xuding (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: