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

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ 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
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0166-218x(01)00219-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2042599036
@@ Property / OpenAlex ID: W2042599036 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5954242