Randomized Δ-edge colouring via exchanges of complex colours (Q2868167): Difference between revisions

@@ Property / cites work @@
+Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
+Normal rank
@@ Property / cites work @@
+Q4797360
@@ Property / cites work: Q4797360 / rank @@
+Normal rank
@@ Property / cites work @@
+Near-optimal, distributed edge colouring via the nibble method
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+The four-colour theorem
@@ Property / cites work: The four-colour theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Generating Random Regular Graphs Quickly
@@ Property / cites work: Generating Random Regular Graphs Quickly / rank @@
+Normal rank