On the number of (<i>r,r</i>+1)- factors in an (<i>r,r</i>+1)-factorization of a simple graph (Q3633008)
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: On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph |
scientific article; zbMATH DE number 5565369
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of (<i>r,r</i>+1)- factors in an (<i>r,r</i>+1)-factorization of a simple graph |
scientific article; zbMATH DE number 5565369 |
Statements
On the number of (<i>r,r</i>+1)- factors in an (<i>r,r</i>+1)-factorization of a simple graph (English)
0 references
16 June 2009
0 references
factors
0 references
factorizations
0 references
(\(r, r+1\))-factorizations
0 references
simple graphs
0 references
semiregular factorizations
0 references
0.9337097
0 references
0.91351694
0 references
0.9030655
0 references
0.89847267
0 references
0 references
0.8949168
0 references
0.8933872
0 references
0.8895047
0 references
