The upper bound of the number of cycles in a 2-factor of a line graph (Q3445503): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/jgt.20220 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.20220 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4254224703 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/JGT.20220 / rank | |||
Normal rank | |||
Latest revision as of 07:42, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The upper bound of the number of cycles in a 2-factor of a line graph |
scientific article |
Statements
The upper bound of the number of cycles in a 2-factor of a line graph (English)
0 references
11 June 2007
0 references
line graph
0 references
2-factor
0 references
number of components
0 references
