List strong edge coloring of planar graphs with maximum degree 4 (Q1732781): Difference between revisions

@@ Property / cites work @@
+The strong chromatic index of a cubic graph is at most 10
+Normal rank
@@ Property / cites work @@
+Strong edge-coloring of graphs with maximum degree 4 using 22 colors
+Normal rank
@@ Property / cites work @@
+Strong list-chromatic index of subcubic graphs
@@ Property / cites work: Strong list-chromatic index of subcubic graphs / rank @@
+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 @@
+Q3320410
@@ Property / cites work: Q3320410 / 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 chromatic index of graphs with maximum degree four
+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 @@
+Planar graphs with maximum degree 4 are strongly 19-edge-colorable
+Normal rank