Graph decomposition with constraints on the connectivity and minimum degree (Q3661610)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graph decomposition with constraints on the connectivity and minimum degree |
scientific article; zbMATH DE number 3813665
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph decomposition with constraints on the connectivity and minimum degree |
scientific article; zbMATH DE number 3813665 |
Statements
Graph decomposition with constraints on the connectivity and minimum degree (English)
0 references
1983
0 references
induced subgraphs
0 references
two set decomposition
0 references
vertex connectivity
0 references
minimum degree
0 references
