A large set of non-Hamiltonian graphs (Q5954242): Difference between revisions

@@ Property / cites work @@
+Not every 2-tough graph is Hamiltonian
@@ Property / cites work: Not every 2-tough graph is Hamiltonian / 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 @@
+Tough graphs and Hamiltonian circuits.
@@ Property / cites work: Tough graphs and Hamiltonian circuits. / rank @@
+Normal rank
@@ Property / cites work @@
+Better approximations of non-Hamiltonian graphs
@@ Property / cites work: Better approximations of non-Hamiltonian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and edge-toughness
@@ Property / cites work: Toughness and edge-toughness / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of facets (and some facets of complexity)
+Normal rank