Edge neighbourhood graphs
Bohdan Zelinka (1986)
Czechoslovak Mathematical Journal
Similarity:
Bohdan Zelinka (1986)
Czechoslovak Mathematical Journal
Similarity:
Fujita, Shinya, Magnant, Colton (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Slobodan K. Simić (1982)
Publications de l'Institut Mathématique
Similarity:
Gould, Ronald, Łuczak, Tomasz, Schmitt, John (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Černý, A., Horák, P., Rosa, A., Znám, Š. (1996)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Patrick Labarque (2010)
Visual Mathematics
Similarity:
Ivan Havel (1968)
Časopis pro pěstování matematiky
Similarity:
Clark, W.Edwin, Dunning, Larry A. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Martin, Ryan, Zhao, Yi (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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