On the Problem of Decomposing a Graph into <i>n</i> Connected Factors (Q3275433): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user 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.1112/jlms/s1-36.1.221 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058858486 / rank | |||
Normal rank | |||
Latest revision as of 23:01, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Problem of Decomposing a Graph into <i>n</i> Connected Factors |
scientific article |
Statements
On the Problem of Decomposing a Graph into <i>n</i> Connected Factors (English)
0 references
1961
0 references
topology
0 references
