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

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ 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
@@ Property / Wikidata QID @@
+Q127155184
@@ Property / Wikidata QID: Q127155184 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0012-365x(95)00324-p
+Normal rank
@@ Property / OpenAlex ID @@
+W2023540209
@@ Property / OpenAlex ID: W2023540209 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1356566