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

← Older edit

@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 4160130
@@ Property / author @@
+D. Bauer
@@ Property / author: D. Bauer / rank @@
+Normal rank
@@ Property / author @@
+S. Louis Hakimi
@@ Property / author: S. Louis Hakimi / rank @@
+Normal rank
@@ Property / author @@
+E. Schmeichel
@@ Property / author: E. Schmeichel / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / 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
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0166-218x(90)90001-s
+Normal rank
@@ Property / OpenAlex ID @@
+W1981583245
@@ Property / OpenAlex ID: W1981583245 / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/dam/BauerHS90
@@ Property / DBLP publication ID: journals/dam/BauerHS90 / rank @@
+Normal rank
@@ Property / Recommended article @@
+On the complexity of recognizing tough graphs
+Normal rank
+Similarity Score: 0.95340884Amount 0.95340884
Unit 1
-Amount
+.95340884
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Q5502385
@@ Property / Recommended article: Q5502385 / rank @@
+Normal rank
@@ Property / Recommended article: Q5502385 / qualifier @@
+Similarity Score: 0.9238191Amount 0.9238191
Unit 1
-Amount
+.9238191
 Unit
@@ Property / Recommended article: Q5502385 / qualifier @@
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+The complexity of recognizing minimally tough graphs
+Normal rank
+Similarity Score: 0.90609443Amount 0.90609443
Unit 1
-Amount
+.90609443
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+NP-hardness of the recognition of coordinated graphs
+Normal rank
+Similarity Score: 0.897601Amount 0.897601
Unit 1
-Amount
+.897601
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Recognizing graphs with fixed interval number is NP-complete
+Normal rank
+Similarity Score: 0.8899978Amount 0.8899978
Unit 1
-Amount
+.8899978
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+The complexity of recognizing tough cubic graphs
+Normal rank
+Similarity Score: 0.88836145Amount 0.88836145
Unit 1
-Amount
+.88836145
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Clique Graph Recognition Is NP-Complete
@@ Property / Recommended article: Clique Graph Recognition Is NP-Complete / rank @@
+Normal rank
+Similarity Score: 0.87918353Amount 0.87918353
Unit 1
-Amount
+.87918353
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Unit disk graph recognition is NP-hard
@@ Property / Recommended article: Unit disk graph recognition is NP-hard / rank @@
+Normal rank
+Similarity Score: 0.8790686Amount 0.8790686
Unit 1
-Amount
+.8790686
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Point visibility graph recognition is NP-hard
+Normal rank
+Similarity Score: 0.876236Amount 0.876236
Unit 1
-Amount
+.876236
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Discontinuities in the complexities of some graph recognition problems
+Normal rank
+Similarity Score: 0.8652944Amount 0.8652944
Unit 1
-Amount
+.8652944
 Unit
+Recommender Run: Recommender Run 3