The size of strength‐maximal graphs
From MaRDI portal
Publication:4713006
DOI10.1002/jgt.3190140207zbMath0756.05071OpenAlexW2085371216MaRDI QIDQ4713006
Publication date: 25 June 1992
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190140207
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Connectivity (05C40)
Related Items (10)
On the lower bound of \(k\)-maximal digraphs ⋮ Large survivable nets and the generalized prisms ⋮ On the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphs ⋮ Bounding \(\ell\)-edge-connectivity in edge-connectivity ⋮ On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs ⋮ Characterizations of strength extremal graphs ⋮ On the sizes of bi-\(k\)-maximal graphs ⋮ On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs ⋮ On the sizes of \((k, l)\)-edge-maximal \(r\)-uniform hypergraphs ⋮ The extremal sizes of arc-maximal \((k, \ell)\)-digraphs
Cites Work
This page was built for publication: The size of strength‐maximal graphs
