Optimal graphs with prescribed connectivities
From MaRDI portal
Recommendations
- On an extremal problem related to a theorem of Whitney
- scientific article; zbMATH DE number 3970793
- Realizability of n-vertex graphs with prescribed vertex connectivity, edge connectivity, minimum degree, and maximum degree
- An extremal problem on the connectivity of graphs
- Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree
Cites work
Cited in
(13)- Optimal proper connection of graphs
- On optimizing restricted edge connectivity of graphs
- Über 1-optimale Graphen
- An extremal problem on the connectivity of graphs
- Graphs with the smallest number of minimum cut sets
- Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree
- scientific article; zbMATH DE number 5534553 (Why is no real title available?)
- scientific article; zbMATH DE number 3970793 (Why is no real title available?)
- scientific article; zbMATH DE number 2077809 (Why is no real title available?)
- scientific article; zbMATH DE number 1390507 (Why is no real title available?)
- Optimal maximal graphs
- Realizability of n-vertex graphs with prescribed vertex connectivity, edge connectivity, minimum degree, and maximum degree
- On the minimum number of vertices and edges in a graph with prescribed connectivities
This page was built for publication: Optimal graphs with prescribed connectivities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2699764)
