The upper bound of the number of cycles in a 2-factor of a line graph (Q3445503)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The upper bound of the number of cycles in a 2-factor of a line graph |
scientific article; zbMATH DE number 5163528
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The upper bound of the number of cycles in a 2-factor of a line graph |
scientific article; zbMATH DE number 5163528 |
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
0.9109349
0 references
0.89066595
0 references
0.88808334
0 references
0.88498557
0 references
0.8814188
0 references
0.8784269
0 references
0.8716168
0 references
0.8682026
0 references
