The matching extension problem in general graphs is co-NP-complete (Q1743490): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-017-0226-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2775963553
@@ Property / OpenAlex ID: W2775963553 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for the extendability problem in bipartite graphs
+Normal rank
@@ Property / cites work @@
+Extending matchings in graphs: A survey
@@ Property / cites work: Extending matchings in graphs: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Recent Progress in Matching Extension
@@ Property / cites work: Recent Progress in Matching Extension / rank @@
+Normal rank
@@ Property / cites work @@
+Construction for bicritical graphs and \(k\)-extendable bipartite graphs
+Normal rank