On locating cubic subgraphs in bounded-degree connected bipartite graphs (Q1356566): Difference between revisions

@@ Property / cites work @@
+`` Strong '' NP-Completeness Results
@@ Property / cites work: `` Strong '' NP-Completeness Results / rank @@
+Normal rank
@@ Property / cites work @@
+Languages that Capture Complexity Classes
@@ Property / cites work: Languages that Capture Complexity Classes / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: an ongoing guide
@@ Property / cites work: The NP-completeness column: an ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding whether a planar graph has a cubic subgraph is NP-complete
+Normal rank
@@ Property / cites work @@
+Complete problems for monotone NP
@@ Property / cites work: Complete problems for monotone NP / rank @@
+Normal rank