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

@@ Property / cites work @@
+Combinatorial Nullstellensatz
@@ Property / cites work: Combinatorial Nullstellensatz / rank @@
+Normal rank
@@ Property / cites work @@
+The strong chromatic index of a cubic graph is at most 10
+Normal rank
@@ Property / cites work @@
+Colouring graphs with sparse neighbourhoods: bounds and applications
+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 @@
+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 @@
+Strong chromatic index of \(k\)-degenerate graphs
@@ Property / cites work: Strong chromatic index of \(k\)-degenerate graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Strong Chromatic Index of Sparse Graphs
@@ Property / cites work: Strong Chromatic Index of Sparse Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Strong edge-colorings for \(k\)-degenerate graphs
@@ Property / cites work: Strong edge-colorings for \(k\)-degenerate graphs / rank @@
+Normal rank