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
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An algorithmic approach to the Lovász local lemma. I / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Automorphisms of Dowling Lattices and Related Geometries / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4857375 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4263664 / rank | |||
Normal rank | |||
Latest revision as of 11:02, 10 June 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
