Graph decomposition with constraints on the connectivity and minimum degree (Q3661610): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.3190070204 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2079854871 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:48, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph decomposition with constraints on the connectivity and minimum degree |
scientific article |
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
