On Vertices of Degree n in Minimally n-Edge-Connected Graphs
From MaRDI portal
Publication:4844492
DOI10.1017/S0963548300001498zbMath0830.05044MaRDI QIDQ4844492
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
Related Items
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