Existentially closed BIBD block-intersection graphs.
McKay, Neil A., Pike, David A. (2007)
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.
Displaying similar documents to “Steiner triple systems and existentially closed graphs.”
Existentially closed BIBD block-intersection graphs.
A new construction of the block systems B(4,1,25) and B(4,1, 28)
B. Rokowska (1977)
Colloquium Mathematicae
Similarity:
The construction of resolvable block-systems
B. Rokowska (1985)
Colloquium Mathematicae
Similarity:
Properties of the Steiner triple systems of order 19.
Colbourn, Charles J., Forbes, Anthony D., Grannell, Mike J., Griggs, Terry S., Kaski, Petteri, Östergård, Patric R.J., Pike, David A., Pottonen, Olli (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The chromatic index of cyclic Steiner 2-designs.
Colbourn, Charles J., Colbourn, Marlene J. (1982)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Block-closed subgraphs and q-partitions of graphs
B. Zelinka (1987)
Applicationes Mathematicae
Similarity:
Some new partially symmetric designs and their resolution
Vlado Cigić (1998)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Class-uniformly resolvable group divisible structures. I: Resolvable group divisible designs.
Danziger, Peter, Stevens, Brett (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Construction of extended Steiner systems for information retrieval.
Eun-Young Park, Ian Blake (2008)
Revista Matemática Complutense
Similarity:
The existence of FGDRP's.
Yan, Jie, Wang, Chengmin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Block decomposition approach to compute a minimum geodetic set
Tınaz Ekim, Aysel Erey (2014)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this paper, we develop a divide-and-conquer approach, called block decomposition, to solve the minimum geodetic set problem. This provides us with a unified approach for all graphs admitting blocks for which the problem of finding a minimum geodetic set containing a given set of vertices (-extension problem) can be efficiently solved. Our method allows us to derive linear time algorithms for the minimum geodetic set problem in (a proper superclass of) block-cacti and monopolar chordal...
Smallest cubic and quartic graphs with a given number of cutpoints and bridges.
Chartrand, Gary, Saba, Farrokh, Cooper, John K.jun., Harary, Frank, Wall, Curtiss E. (1982)
International Journal of Mathematics and Mathematical Sciences
Similarity:
New prolific constructions of strongly regular graphs.
Fon-Der-Flaass, Dmitry G. (2002)
Advances in Geometry
Similarity: