Nebesky, Ladislav A theorem on 2-connected graphs. (English) Zbl 0302.05111 Čas. Pěst. Mat. 100, 116-117 (1975). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 Document MSC: 05C35 Extremal problems in graph theory PDF BibTeX XML Cite \textit{L. Nebesky}, Čas. Pěstování Mat. 100, 116--117 (1975; Zbl 0302.05111) Full Text: EuDML OpenURL