Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density (Q1011746): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.01.010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2126027527 / rank | |||
Normal rank | |||
Revision as of 00:09, 20 March 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
