On the minimum degree and edge-connectivity of a graph

<a class="pub-badge pub-badge--doi" href="https://doi.org/10.21136/CPM.1976.117895" rel="nofollow">DOI 10.21136/CPM.1976.117895</a><a class="pub-badge pub-badge--grey" href="https://zbmath.org/0328.05126" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--grey" href="https://openalex.org/works/W3048035890" rel="nofollow">OpenAlex</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q4093477" rel="nofollow">MaRDI QID Q4093477</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q4093477" rel="nofollow">FDO</a>

Authors Ladislav Nebeský

Publication date 1976

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

This page was built for publication: On the minimum degree and edge-connectivity of a graph

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