Avoiding rainbow induced subgraphs in vertex-colorings.
Axenovich, Maria, Martin, Ryan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A two parameter chromatic symmetric function.”
Avoiding rainbow induced subgraphs in vertex-colorings.
The order of monochromatic subgraphs with a given minimum degree.
Caro, Yair, Yuster, Raphael (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rainbow -factors.
Yuster, Raphael (2006)
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:
A note on graph coloring extensions and list-colorings.
Axenovich, Maria (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On subgraphs induced by transversals in vertex-partitions of graphs.
Axenovich, Maria (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dense -free graphs are almost -partite.
Allen, Peter (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the maximum average degree and the incidence chromatic number of a graph.
Hosseini Dolama, Mohammad, Sopena, Eric (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
An extremal property of Turán graphs.
Lazebnik, Felix, Tofts, Spencer (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vertex Colorings without Rainbow Subgraphs
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...
Computation of the vertex Folkman numbers and .
Nedialkov, Evgeni, Nenov, Nedyalko (2002)
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:
Circular degree choosability.
Norine, Serguei, Zhu, Xuding (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: