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

@@ Property / cites work @@
+The strong chromatic index of a cubic graph is at most 10
+Normal rank
@@ Property / cites work @@
+Precise upper bound for the strong edge chromatic number of sparse planar graphs
+Normal rank
@@ Property / cites work @@
+A stronger bound for the strong chromatic index (extended abstract)
+Normal rank
@@ Property / cites work @@
+Strong edge-coloring of graphs with maximum degree 4 using 22 colors
+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 @@
+Strong edge-coloring of planar graphs
@@ Property / cites work: Strong edge-coloring of planar 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