The acyclic edge chromatic number of a random <i>d</i>‐regular graph is <i>d</i> + 1 (Q4680406)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2173316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9253916144371032
0 references
0.8754604458808899
0 references
0.8754604458808899
0 references
0.8570983409881592
0 references
0.8509041666984558
0 references
