Recognizing tough graphs is NP-hard (Q918697): Difference between revisions

@@ Property / author @@
-Douglas Bauer
@@ Property / author: Douglas Bauer / rank @@
-Normal rank
@@ Property / author @@
-S. Louis Hakimi
@@ Property / author: S. Louis Hakimi / rank @@
-Normal rank
@@ Property / author @@
-Edward F. Schmeichel
@@ Property / author: Edward F. Schmeichel / rank @@
-Normal rank
@@ Property / author @@
+Douglas Bauer
@@ Property / author: Douglas Bauer / rank @@
+Normal rank
@@ Property / author @@
+S. Louis Hakimi
@@ Property / author: S. Louis Hakimi / 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 @@
+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 @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Tough graphs and Hamiltonian circuits.
@@ Property / cites work: Tough graphs and Hamiltonian circuits. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3689218
@@ Property / cites work: Q3689218 / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and the existence ofk-factors
@@ Property / cites work: Toughness and the existence ofk-factors / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / 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 @@
+Long Cycles in Digraphs
@@ Property / cites work: Long Cycles in Digraphs / rank @@
+Normal rank