Strong edge-coloring of planar graphs (Q5920291): Difference between revisions

@@ Property / cites work @@
+The strong chromatic index of a cubic graph is at most 10
+Normal rank
@@ Property / cites work @@
+Problems and results in combinatorial analysis and graph theory
+Normal rank
@@ Property / cites work @@
+Q5752590
@@ Property / cites work: Q5752590 / rank @@
+Normal rank
@@ Property / cites work @@
+On strong edge-colouring of subcubic graphs
@@ Property / cites work: On strong edge-colouring of subcubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Strong edge colouring of subcubic graphs
@@ Property / cites work: Strong edge colouring of subcubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Induced matchings in cubic graphs
@@ Property / cites work: Induced matchings in cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A bound on the strong chromatic index of a graph
@@ Property / cites work: A bound on the strong chromatic index of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+On induced matchings
@@ Property / cites work: On induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar graph with maximum degree 7 is of class 1
+Normal rank