Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density (Q1011746): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:24, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density |
scientific article |
Statements
Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density (English)
0 references
9 April 2009
0 references
graph minors
0 references
edge density
0 references
connected subgraphs
0 references
