The upper bound of the number of cycles in a 2-factor of a line graph (Q3445503): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:46, 4 February 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
