The Ramsey numbers of large cycles versus small wheels.
Surahmat, Baskoro, E.T., Broersma, H.J. (2004)
Integers
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 “Random procedures for dominating sets in graphs.”
The Ramsey numbers of large cycles versus small wheels.
Centers and centroids of unicyclic graphs
Mirosław Truszczyński (1985)
Mathematica Slovaca
Similarity:
Notes on nonrepetitive graph colouring.
Barát, János, Wood, David R. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graphs with a given edge neighbourhood
Dalibor Fronček (1989)
Czechoslovak Mathematical Journal
Similarity:
Sequences of dominating sets.
Kostochka, A.V. (1990)
Mathematica Pannonica
Similarity:
Dense -free graphs are almost -partite.
Allen, Peter (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
An inequality related to Vizing's conjecture.
Clark, W.Edwin, Suen, Stephen (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graphs with four boundary vertices.
Müller, Tobias, Pór, Attila, Sereni, Jean-Sébastien (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Isosceles sets.
Ionin, Yury J. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: