Indestructive deletions of edges from graphs
From MaRDI portal
Publication:1164646
DOI10.1016/0095-8956(81)90043-5zbMath0486.05044OpenAlexW1972879641MaRDI QIDQ1164646
Publication date: 1981
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(81)90043-5
Related Items (3)
Factors and factorizations of graphs—a survey ⋮ Extensions de réseaux de connexité donnée. (Extensions of graphs of given connectivity) ⋮ On Vertices of Degree n in Minimally n-Edge-Connected Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Endlichkeitssätze für k-kritische Graphen
- On k-critical, n-connected graphs
- On k-minimally n-edge-connected graphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
- Kantendisjunkte Wege in Graphen
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
- Subgraphs with prescribed valencies
- A Short Proof of the Factor Theorem for Finite Graphs
This page was built for publication: Indestructive deletions of edges from graphs
