The acyclic edge chromatic number of a random <i>d</i>‐regular graph is <i>d</i> + 1 (Q4680406): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q326820 |
Changed an Item |
||
| Property / author | |||
| Property / author: Nicholas C. Wormald / rank | |||
Normal rank | |||
Revision as of 04:10, 13 February 2024
scientific article; zbMATH DE number 2173316
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The acyclic edge chromatic number of a random <i>d</i>‐regular graph is <i>d</i> + 1 |
scientific article; zbMATH DE number 2173316 |
Statements
The acyclic edge chromatic number of a random <i>d</i>‐regular graph is <i>d</i> + 1 (English)
0 references
1 June 2005
0 references
coloring
0 references
acyclic coloring
0 references
edge coloring
0 references
regular graphs
0 references
random graphs
0 references
