Minimal k-connected graphs with small number of vertices of degree k
From MaRDI portal
(Redirected from Publication:4976398)
Minimal \(k\)-connected graphs with small number of vertices of degree \(k\)
Minimal \(k\)-connected graphs with small number of vertices of degree \(k\)
Recommendations
- Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\)
- A remark on the number of vertices of degree k in a minimally k-edge- connected graph
- On elements in small cocircuits in minimally k-connected graphs and matroids
- The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph
- Connectivity keeping trees in 2-connected graphs
Cited in
(17)- Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)
- A remark on the number of vertices of degree k in a minimally k-edge- connected graph
- On local structure of 9- and 10-connected graphs
- On vertices of degree \(k\) of minimal and contraction critical \(k\)-connected graphs: upper bounds
- On extremal \(k\)-outconnected graphs
- Minimally \((n,\lambda)\)-connected graphs of low order and maximal size
- The tree of cuts and minimal \(k\)-connected graphs
- Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\)
- scientific article; zbMATH DE number 3912418 (Why is no real title available?)
- Tight bounds for the vertices of degree k in minimally k‐connected graphs
- scientific article; zbMATH DE number 4118386 (Why is no real title available?)
- scientific article; zbMATH DE number 3893241 (Why is no real title available?)
- Turán's theorem and k‐connected graphs
- scientific article; zbMATH DE number 2191994 (Why is no real title available?)
- Minimal \(N_{+}\)-rank graphs: progress on Lipták and Tunçel's conjecture
- On the number of edges in a graph with no \((k + 1)\)-connected subgraphs
- Minimal biconnected graphs
This page was built for publication: Minimal \(k\)-connected graphs with small number of vertices of degree \(k\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976398)