On a two-sided Turán problem.
Mubayi, Dhruv, Zhao, Yi (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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:
A combinatorial approach to singularities of normal surfaces
Sandro Manfredini (2003)
Annali della Scuola Normale Superiore di Pisa - Classe di Scienze
Similarity:
In this paper we study generic coverings of branched over a curve s.t. the total space is a normal analytic surface, in terms of a graph representing the monodromy of the covering, called monodromy graph. A complete description of the monodromy graphs and of the local fundamental groups is found in case the branch curve is (with ) and the degree of the cover is equal to or .