A note on odd cycle-complete graph Ramsey numbers.
Sudakov, Benny (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Graphs with many copies of a given subgraph.”
A note on odd cycle-complete graph Ramsey numbers.
Dense -free graphs are almost -partite.
Allen, Peter (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Homomorphisms of infinite bipartite graphs onto complete bipartite graphs
Bohdan Zelinka (1983)
Czechoslovak Mathematical Journal
Similarity:
Edge neighbourhood graphs
Bohdan Zelinka (1986)
Czechoslovak Mathematical Journal
Similarity:
Holes in graphs.
Peng, Yuejian, Rödl, Vojtech, Ruciński, Andrzej (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Randomly complete -partite graphs
Yousef Alavi, Don R. Lick, Song Lin Tian (1989)
Mathematica Slovaca
Similarity:
Graph compositions. I: Basic enumeration.
Knopfmacher, A., Mays, M.E. (2001)
Integers
Similarity: