Induced Matchings in Graphs of Bounded Maximum Degree (Q2826215): Difference between revisions

@@ Property / arXiv ID @@
+.2440
@@ Property / arXiv ID: 1406.2440 / rank @@
+Normal rank
@@ Property / cites work @@
+A stronger bound for the strong chromatic index (extended abstract)
+Normal rank
@@ Property / cites work @@
+Induced matchings
@@ Property / cites work: Induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+New results on maximum induced matchings in bipartite graphs and beyond
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Q5752590
@@ Property / cites work: Q5752590 / rank @@
+Normal rank
@@ Property / cites work @@
+Induced matchings in subcubic graphs without short cycles
+Normal rank
@@ Property / cites work @@
+Induced Matchings in Graphs of Degree at Most 4
@@ Property / cites work: Induced Matchings in Graphs of Degree at Most 4 / rank @@
+Normal rank
@@ Property / cites work @@
+Induced Matchings in Subcubic Graphs
@@ Property / cites work: Induced Matchings in Subcubic Graphs / rank @@
+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 @@
+NP-completeness of some generalizations of the maximum matching problem
+Normal rank
@@ Property / cites work @@
+Q4944970
@@ Property / cites work: Q4944970 / rank @@
+Normal rank