Indestructive deletions of edges from graphs
From MaRDI portal
Cites work
- A Short Proof of the Factor Theorem for Finite Graphs
- Ecken vom Grad n in minimalen n-fach zusammenhängenden Graphen
- Endlichkeitssätze für k-kritische Graphen
- scientific article; zbMATH DE number 3141016 (Why is no real title available?)
- scientific article; zbMATH DE number 3166039 (Why is no real title available?)
- Kantendisjunkte Wege in Graphen
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- On k-critical, n-connected graphs
- On k-minimally n-edge-connected graphs
- Subgraphs with prescribed valencies
Cited in
(5)- Extensions de réseaux de connexité donnée. (Extensions of graphs of given connectivity)
- Factors and factorizations of graphs—a survey
- On Vertices of Degree n in Minimally n-Edge-Connected Graphs
- Maximal spectral radius of minimally k-(edge)-connected graphs
- A max-min problem on spectral radius and connectedness of graphs
This page was built for publication: Indestructive deletions of edges from graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1164646)