A theorem on connected graphs in which every edge belongs to a 1-factor (Q4777332): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q5648381 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s144678870002913x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2085270840 / rank | |||
Normal rank | |||
Latest revision as of 08:47, 30 July 2024
scientific article; zbMATH DE number 3453658
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A theorem on connected graphs in which every edge belongs to a 1-factor |
scientific article; zbMATH DE number 3453658 |
Statements
A theorem on connected graphs in which every edge belongs to a 1-factor (English)
0 references
1974
0 references
