Construction of class two graphs with maximum vertex degree three (Q1147159): Difference between revisions

@@ Property / cites work @@
+On the edge-chromatic number of a graph
@@ Property / cites work: On the edge-chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5837978
@@ Property / cites work: Q5837978 / rank @@
+Normal rank
@@ Property / cites work @@
+Network-Colourings
@@ Property / cites work: Network-Colourings / rank @@
+Normal rank
@@ Property / cites work @@
+Q3853641
@@ Property / cites work: Q3853641 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4180376
@@ Property / cites work: Q4180376 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3206979
@@ Property / cites work: Q3206979 / rank @@
+Normal rank
@@ Property / cites work @@
+Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
+Normal rank
@@ Property / cites work @@
+Some remarks on the chromatic index of a graph
@@ Property / cites work: Some remarks on the chromatic index of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+On critical graphs with chromatic index 4
@@ Property / cites work: On critical graphs with chromatic index 4 / rank @@
+Normal rank
@@ Property / cites work @@
+Polyhedral decompositions of cubic graphs
@@ Property / cites work: Polyhedral decompositions of cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4517442
@@ Property / cites work: Q4517442 / rank @@
+Normal rank