Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (Q1613360): Difference between revisions

@@ Property / author @@
+Douglas Bauer
@@ Property / author: Douglas Bauer / rank @@
+Normal rank
@@ Property / author @@
+Hajo J. Broersma
@@ Property / author: Hajo J. Broersma / rank @@
+Normal rank
@@ Property / author @@
+Aurora Morgana
@@ Property / author: Aurora Morgana / rank @@
+Normal rank
@@ Property / author @@
+Edward F. Schmeichel
@@ Property / author: Edward F. Schmeichel / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing tough graphs is NP-hard
@@ Property / cites work: Recognizing tough graphs is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+A simple proof of a theorem of Jung
@@ Property / cites work: A simple proof of a theorem of Jung / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of recognizing tough graphs
@@ Property / cites work: On the complexity of recognizing tough graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Long cycles in graphs with large degree sums
@@ Property / cites work: Long cycles in graphs with large degree sums / rank @@
+Normal rank
@@ Property / cites work @@
+Q4350166
@@ Property / cites work: Q4350166 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5187226
@@ Property / cites work: Q5187226 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on Hamiltonian circuits
@@ Property / cites work: A note on Hamiltonian circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Structure of Non-Hamiltonian Graphs I
@@ Property / cites work: On the Structure of Non-Hamiltonian Graphs I / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+pretty graph colouring problems
@@ Property / cites work: 25 pretty graph colouring problems / rank @@
+Normal rank
@@ Property / cites work @@
+On Maximal Circuits in Finite Graphs
@@ Property / cites work: On Maximal Circuits in Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Cycle lengths and chromatic number of graphs
@@ Property / cites work: Cycle lengths and chromatic number of graphs / rank @@
+Normal rank