An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs (Q1690216): Difference between revisions

@@ Property / OpenAlex ID @@
+W2963364355
@@ Property / OpenAlex ID: W2963364355 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.09475
@@ Property / arXiv ID: 1705.09475 / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness in graphs -- a survey
@@ Property / cites work: Toughness in graphs -- a survey / 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 @@
+More than one tough chordal planar graphs are Hamiltonian
+Normal rank
@@ Property / cites work @@
+Long cycles in 3-connected graphs
@@ Property / cites work: Long cycles in 3-connected graphs / 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 @@
+An upper bound on the shortness exponent of 1-tough, maximal planar graphs
+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 @@
+Toughness and nonhamiltonicity of polyhedral graphs
+Normal rank
@@ Property / cites work @@
+Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs
+Normal rank
@@ Property / cites work @@
+Simple paths on polyhedra
@@ Property / cites work: Simple paths on polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Q4518404
@@ Property / cites work: Q4518404 / rank @@
+Normal rank
@@ Property / cites work @@
+Shortness parameters for polyhedral graphs
@@ Property / cites work: Shortness parameters for polyhedral graphs / rank @@
+Normal rank
@@ Property / cites work @@
+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