Minimal biconnected graphs
From MaRDI portal
Recommendations
- Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\)
- Minimal \(k\)-connected graphs with small number of vertices of degree \(k\)
- On Vertices of Degree n in Minimally n-Edge-Connected Graphs
- On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\)
- Minimal bricks
Cites work
- scientific article; zbMATH DE number 3166039 (Why is no real title available?)
- scientific article; zbMATH DE number 5161490 (Why is no real title available?)
- scientific article; zbMATH DE number 1960407 (Why is no real title available?)
- scientific article; zbMATH DE number 878899 (Why is no real title available?)
- scientific article; zbMATH DE number 3236772 (Why is no real title available?)
- Minimally 2-connected graphs.
- On Minimal Blocks
- On some extremal connectivity results for graphs and matroids
- The decomposition of graphs into \(k\)-connected components
- Zur Struktur minimal n-fach zusammenhängender Graphen
Cited in
(9)- Large contractible subgraphs of a 3-connected graph
- Decomposition of a 2-connected graph into three connected subgraphs
- scientific article; zbMATH DE number 5720940 (Why is no real title available?)
- scientific article; zbMATH DE number 3981211 (Why is no real title available?)
- Minimal configuration bicyclic graphs
- On semi-reconstruction of graphs of connectivity 2
- Every 3-connected graph with at least 13 vertices has a contractible set with 5 vertices
- Restriction on minimum degree in the contractible sets problem
- On reconstruction of a graph of connectivity 2 having a 2-vertex set dividing it into at least 3 parts
This page was built for publication: Minimal biconnected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q906762)
