On the number of (<i>r,r</i>+1)- factors in an (<i>r,r</i>+1)-factorization of a simple graph (Q3633008): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.20356 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4253679109 / rank | |||
Normal rank | |||
Revision as of 20:57, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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 |
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
