Strong edge-colorings for \(k\)-degenerate graphs (Q497384): Difference between revisions

@@ Property / arXiv ID @@
+.6093
@@ Property / arXiv ID: 1212.6093 / rank @@
+Normal rank
@@ Property / cites work @@
+The strong chromatic index of a cubic graph is at most 10
+Normal rank
@@ Property / cites work @@
+Strong Chromatic Index of 2-Degenerate Graphs
@@ Property / cites work: Strong Chromatic Index of 2-Degenerate Graphs / rank @@
+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 @@
+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 @@
+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 @@
+Q3118960
@@ Property / cites work: Q3118960 / rank @@
+Normal rank