Toughness and nonhamiltonicity of polyhedral graphs (Q2366022): Difference between revisions

@@ Property / cites work @@
+Tough graphs and Hamiltonian circuits.
@@ Property / cites work: Tough graphs and Hamiltonian circuits. / rank @@
+Normal rank
@@ Property / cites work @@
+A 1-tough nonhamiltonian maximal planar graph
@@ Property / cites work: A 1-tough nonhamiltonian maximal planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+An upper bound on the shortness exponent of 1-tough, maximal planar graphs
+Normal rank
@@ Property / cites work @@
+A Theorem on Planar Graphs
@@ Property / cites work: A Theorem on Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Shortness exponents of families of graphs
@@ Property / cites work: Shortness exponents of families of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5575344
@@ Property / cites work: Q5575344 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4775880
@@ Property / cites work: Q4775880 / rank @@
+Normal rank