A theorem on 2-connected graphs

DOI10.21136/CPM.1975.108774zbMATH Open0302.05111OpenAlexW3048321984MaRDI QIDQ4055665FDOQ4055665

Authors: Ladislav Nebeský 

Publication date: 1975

Full work available at URL: https://eudml.org/doc/19604

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (1)

• On the number of noncritical vertices in strongly connected digraphs

This page was built for publication: A theorem on $2$-connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4055665)