The acyclic edge chromatic number of a random d‐regular graph is d + 1 (Q4680406): Difference between revisions

@@ Property / DOI @@
-.1002/jgt.20064
@@ Property / DOI: 10.1002/jgt.20064 / rank @@
-Normal rank
@@ Property / author @@
-Q186263
@@ Property / author: Q186263 / rank @@
-Normal rank
@@ Property / author @@
+Nicholas C. Wormald
@@ Property / author: Nicholas C. Wormald / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/jgt.20064
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.20064 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4235275672
@@ Property / OpenAlex ID: W4235275672 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithmic approach to the Lovász local lemma. I
+Normal rank
@@ Property / cites work @@
+Automorphisms of Dowling Lattices and Related Geometries
+Normal rank
@@ Property / cites work @@
+Q4857375
@@ Property / cites work: Q4857375 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263664
@@ Property / cites work: Q4263664 / rank @@
+Normal rank
@@ Property / DOI @@
+.1002/JGT.20064
@@ Property / DOI: 10.1002/JGT.20064 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4680406

The acyclic edge chromatic number of a random <i>d</i>‐regular graph is <i>d</i> + 1 (Q4680406): Difference between revisions