Avoiding rainbow induced subgraphs in vertex-colorings.
Axenovich, Maria, Martin, Ryan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Star coloring high girth planar graphs.”
Avoiding rainbow induced subgraphs in vertex-colorings.
On subgraphs induced by transversals in vertex-partitions of graphs.
Axenovich, Maria (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:
A characterization of graphs in which some minimum dominating set covers all the edges
Bert L. Hartnell, Douglas F. Rall (1995)
Czechoslovak Mathematical Journal
Similarity:
On graphs with restricted link graphs and the chromatic number at most
Halina Bielak (1988)
Časopis pro pěstování matematiky
Similarity:
The ramsey number for theta graph versus a clique of order three and four
M.S.A. Bataineh, M.M.M. Jaradat, M.S. Bateeha (2014)
Discussiones Mathematicae Graph Theory
Similarity:
For any two graphs F1 and F2, the graph Ramsey number r(F1, F2) is the smallest positive integer N with the property that every graph on at least N vertices contains F1 or its complement contains F2 as a subgraph. In this paper, we consider the Ramsey numbers for theta-complete graphs. We determine r(θn,Km) for m = 2, 3, 4 and n > m. More specifically, we establish that r(θn,Km) = (n − 1)(m − 1) + 1 for m = 3, 4 and n > m
Minimal size of a graph with diameter 2 and given maximal degree. II.
Znám, Š. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
The order of monochromatic subgraphs with a given minimum degree.
Caro, Yair, Yuster, Raphael (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity: