The complexity of recognizing tough cubic graphs (Q1372728): Difference between revisions

@@ Property / author @@
-Douglas Bauer
@@ Property / author: Douglas Bauer / rank @@
-Normal rank
@@ Property / author @@
-Jan van den Heuvel
@@ Property / author: Jan van den Heuvel / 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 / author @@
+Douglas Bauer
@@ Property / author: Douglas Bauer / rank @@
+Normal rank
@@ Property / author @@
+Jan van den Heuvel
@@ Property / author: Jan van den Heuvel / 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 @@
+Q3888545
@@ Property / cites work: Q3888545 / rank @@
+Normal rank
@@ Property / cites work @@
+The smallest 2-connected cubic bipartite planar nonhamiltonian graph
+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 @@
+On the complexity of recognizing tough graphs
@@ Property / cites work: On the complexity of recognizing tough graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3818315
@@ Property / cites work: Q3818315 / 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 @@
+Q3684150
@@ Property / cites work: Q3684150 / rank @@
+Normal rank
@@ Property / cites work @@
+An upper bound on the shortness exponent of 1-tough, maximal planar graphs
+Normal rank
@@ Property / cites work @@
+On the toughness index of planar graphs
@@ Property / cites work: On the toughness index of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some Theorems on Abstract Graphs
@@ Property / cites work: Some Theorems on Abstract Graphs / 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 @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+Q4873831
@@ Property / cites work: Q4873831 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4326197
@@ Property / cites work: Q4326197 / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness, hamiltonicity and split graphs
@@ Property / cites work: Toughness, hamiltonicity and split graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian results inK1,3-free graphs
@@ Property / cites work: Hamiltonian results inK1,3-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity, genus, and the number of components in vertex-deleted subgraphs
+Normal rank
@@ Property / cites work @@
+Long Cycles in Digraphs
@@ Property / cites work: Long Cycles in Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A theorem on paths in planar graphs
@@ Property / cites work: A theorem on paths in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Theorem on Planar Graphs
@@ Property / cites work: A Theorem on Planar Graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1372728