On k-minimally n-edge-connected graphs
From MaRDI portal
Publication:1253668
DOI10.1016/0012-365X(78)90198-XzbMath0397.05033MaRDI QIDQ1253668
Stephen B. Maurer, Peter J. Slater
Publication date: 1978
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (10)
On several sorts of connectivity ⋮ On Vertex-Edge-Critically n-Connected Graphs ⋮ On \(k\)-critical connected line graphs ⋮ On multiply critically h-connected graphs ⋮ The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree ⋮ Indestructive deletions of edges from graphs ⋮ Removable edges in a 5-connected graph and a construction method of 5-connected graphs ⋮ Vertex colorings without isolates ⋮ On k-critical, n-connected graphs ⋮ Minimally 4-edge\(^ \#\)-connected graphs
Cites Work
- Unnamed Item
- Vertex colorings without isolates
- On k-critical, n-connected graphs
- Parallel concepts in graph theory
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
- Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen
- Kantendisjunkte Wege in Graphen
- A homology theory for spanning tress of a graph
- Minimally n-line connected graphs.
This page was built for publication: On k-minimally n-edge-connected graphs
