On Vertices of Degree n in Minimally n-Edge-Connected Graphs

DOI10.1017/S0963548300001498zbMath0830.05044OpenAlexW2082823229MaRDI QIDQ4844492

W. Mader

Publication date: 27 August 1995

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300001498

zbMATH Keywords

lower boundminimally \(n\)-edge-connected graph

Mathematics Subject Classification ID

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

Related Items (2)

Connectivity preserving trees in k‐connected or k‐edge‐connected graphs ⋮ Extremal infinite graph theory

Cites Work

• The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph
• Indestructive deletions of edges from graphs
• A remark on the number of vertices of degree \(k\) in a minimally \(k\)-edge- connected graph
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• Kantendisjunkte Wege in Graphen
• A Reduction Method for Edge-Connectivity in Graphs

This page was built for publication: On Vertices of Degree n in Minimally n-Edge-Connected Graphs