The strong chromatic index of Halin graphs (Q411659): Difference between revisions

@@ Property / cites work @@
+The strong chromatic index of a cubic graph is at most 10
+Normal rank
@@ Property / cites work @@
+Vertex-distinguishing proper edge-colorings
@@ Property / cites work: Vertex-distinguishing proper edge-colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Induced matchings
@@ Property / cites work: Induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q5752590
@@ Property / cites work: Q5752590 / rank @@
+Normal rank
@@ Property / cites work @@
+New results on induced matchings
@@ Property / cites work: New results on induced matchings / 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 @@
+The strong chromatic index ofC4-free graphs
@@ Property / cites work: The strong chromatic index ofC4-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of strong edge coloring
+Normal rank
@@ Property / cites work @@
+A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
+Normal rank
@@ Property / cites work @@
+Q3423984
@@ Property / cites work: Q3423984 / rank @@
+Normal rank
@@ Property / cites work @@
+The strong chromatic index of complete cubic Halin graphs
+Normal rank