scientific article; zbMATH DE number 3312526
From MaRDI portal
Publication:5592932
Cited in
(13)- A clustering algorithm based on graph connectivity
- In search of the densest subgraph
- The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
- Bounding \(\ell\)-edge-connectivity in edge-connectivity
- On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs
- On the sizes of bi-k-maximal graphs
- On the sizes of vertex-k-maximal r-uniform hypergraphs
- On the lower bound of \(k\)-maximal digraphs
- Finding maximum subgraphs with relatively large vertex connectivity
- Probabilistic properties of highly connected random geometric graphs
- Spectral conditions for the maximum subgraph edge-connectivity of graphs
- A survey on the vertex-(edge-)k-maximal graphs and the k-vertex-(edge-)connected graphs with redundant subgraphs
- On the sizes of bi-k-edge-maximal r-uniform hypergraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5592932)
