scientific article; zbMATH DE number 3312526
From MaRDI portal
Publication:5592932
zbMath0196.27204MaRDI QIDQ5592932
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the lower bound of \(k\)-maximal digraphs ⋮ Finding maximum subgraphs with relatively large vertex connectivity ⋮ Bounding \(\ell\)-edge-connectivity in edge-connectivity ⋮ On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs ⋮ In search of the densest subgraph ⋮ Probabilistic properties of highly connected random geometric graphs ⋮ On the sizes of bi-\(k\)-maximal graphs ⋮ On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs ⋮ A clustering algorithm based on graph connectivity ⋮ The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
