scientific article; zbMATH DE number 2191994
From MaRDI portal
Publication:5463356
zbMath1078.05054MaRDI QIDQ5463356
Publication date: 4 August 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (6)
Partitioning a Graph into Highly Connected Subgraphs ⋮ Weak saturation number of a complete bipartite graph ⋮ On the number of edges in a graph with no \((k + 1)\)-connected subgraphs ⋮ On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs ⋮ A note on the saturation number of the family of \(k\)-connected graphs ⋮ On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs
This page was built for publication: