Kritisch n-fach kantenzusammenhängende Graphen. (Critically n-edge- connected graphs)

DOI10.1016/0095-8956(86)90073-0zbMath0579.05036OpenAlexW2065923994MaRDI QIDQ1066913

W. Mader

Publication date: 1986

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(86)90073-0

zbMATH Keywords

critically n-edge-connected graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (2)

Critical vertices in \(k\)-connected digraphs ⋮ Extremal infinite graph theory

Cites Work

• A theorem on n-connected graphs
• Critically n-Connected Graphs
• Minimally n-line connected graphs.
• Unnamed Item

This page was built for publication: Kritisch n-fach kantenzusammenhängende Graphen. (Critically n-edge- connected graphs)