Strong edge-colouring and induced matchings (Q2445264): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2013.07.026
+Normal rank
@@ Property / OpenAlex ID @@
+W2086668882
@@ Property / OpenAlex ID: W2086668882 / rank @@
+Normal rank
@@ Property / cites work @@
+Induced matchings
@@ Property / cites work: Induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+On the approximability of the maximum induced matching problem
+Normal rank
@@ Property / cites work @@
+Induced matchings in bipartite graphs
@@ Property / cites work: Induced matchings in bipartite graphs / rank @@
+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 @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+A special planar satisfiability problem and a consequence of its NP- completeness
+Normal rank
@@ Property / cites work @@
+On maximum induced matchings in bipartite graphs
@@ Property / cites work: On maximum induced matchings in bipartite 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