The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4 (Q5232150): Difference between revisions

@@ Property / cites work @@
+Colouring the petals of a graph
@@ Property / cites work: Colouring the petals of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Subcubic Edge‐Chromatic Critical Graphs Have Many Edges
+Normal rank
@@ Property / cites work @@
+On the chromatic index of almost all graphs
@@ Property / cites work: On the chromatic index of almost all graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Méthode et théorème général de coloration des aretes d'un multigraphe
+Normal rank
@@ Property / cites work @@
+The chromatic index of a graph whose core has maximum degree two
+Normal rank
@@ Property / cites work @@
+Q4892326
@@ Property / cites work: Q4892326 / rank @@
+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 @@
+Q3118960
@@ Property / cites work: Q3118960 / rank @@
+Normal rank