On strong edge-colouring of subcubic graphs (Q2444538): Difference between revisions

@@ Property / cites work @@
+The strong chromatic index of a cubic graph is at most 10
+Normal rank
@@ Property / cites work @@
+The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
+Normal rank
@@ Property / cites work @@
+Strong edge-coloring of graphs with maximum degree 4 using 22 colors
+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 @@
+Q3216671
@@ Property / cites work: Q3216671 / 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