Partitioning a Graph into Highly Connected Subgraphs (Q3188667)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a Graph into Highly Connected Subgraphs |
scientific article |
Statements
Partitioning a Graph into Highly Connected Subgraphs (English)
0 references
12 August 2016
0 references
\(k\)-proper partition of a graph
0 references
