Existentially closed BIBD block-intersection graphs.
McKay, Neil A., Pike, David A. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
McKay, Neil A., Pike, David A. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
B. Rokowska (1977)
Colloquium Mathematicae
Similarity:
B. Rokowska (1985)
Colloquium Mathematicae
Similarity:
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:
Colbourn, Charles J., Colbourn, Marlene J. (1982)
International Journal of Mathematics and Mathematical Sciences
Similarity:
B. Zelinka (1987)
Applicationes Mathematicae
Similarity:
Vlado Cigić (1998)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Danziger, Peter, Stevens, Brett (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Eun-Young Park, Ian Blake (2008)
Revista Matemática Complutense
Similarity:
Yan, Jie, Wang, Chengmin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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...
Chartrand, Gary, Saba, Farrokh, Cooper, John K.jun., Harary, Frank, Wall, Curtiss E. (1982)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Fon-Der-Flaass, Dmitry G. (2002)
Advances in Geometry
Similarity: