On a two-sided Turán problem.
Mubayi, Dhruv, Zhao, Yi (2003)
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.
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.
The search session has expired. Please query the service again.
Displaying similar documents to “Efficient covering designs of the complete graph.”
On a two-sided Turán problem.
Leaves, excesses and neighborhoods
Charles J. Colbourn (1987)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Ear decompositions in combed graphs.
de Carvalho, Marcelo H., Little, C.H.C. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Irreducible coverings by cliques and Sperner's theorem.
Tomescu, Ioan (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Circular chromatic index of generalized Blanuša snarks.
Ghebleh, Mohammad (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cyclicity of a complete 3-equipartite graph
Bohdan Zelinka (1985)
Archivum Mathematicum
Similarity:
The excessive [3]-index of all graphs.
Cariolaro, David, Fu, Hung-Lin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on neighbour-distinguishing regular graphs total-weighting.
Przybylo, Jakub (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: