Hamiltonian properties of polyhedra with few 3-cuts. A survey (Q724894): Difference between revisions

@@ Property / cites work @@
+Chordal and timbral morphologies using Hamiltonian cycles
+Normal rank
@@ Property / cites work @@
+Cycles through 23 vertices in 3-connected cubic planar graphs
+Normal rank
@@ Property / cites work @@
+Nonhamiltonian 3-Connected Cubic Planar Graphs
@@ Property / cites work: Nonhamiltonian 3-Connected Cubic Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
+Normal rank
@@ Property / cites work @@
+On Hamiltonian cycles in 4- and 5-connected plane triangulations
+Normal rank
@@ Property / cites work @@
+Q4882477
@@ Property / cites work: Q4882477 / rank @@
+Normal rank
@@ Property / cites work @@
+On certain Hamiltonian cycles in planar graphs
@@ Property / cites work: On certain Hamiltonian cycles in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations
+Normal rank
@@ Property / cites work @@
+On the number of hamiltonian cycles in triangulations with few separating triangles
+Normal rank
@@ Property / cites work @@
+Polyhedra with few 3-cuts are Hamiltonian
@@ Property / cites work: Polyhedra with few 3-cuts are Hamiltonian / rank @@
+Normal rank
@@ Property / cites work @@
+Any maximal planar graph with only one separating triangle is Hamiltonian
+Normal rank
@@ Property / cites work @@
+Cycles in 4-connected planar graphs
@@ Property / cites work: Cycles in 4-connected planar graphs / 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 @@
+The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
+Normal rank
@@ Property / cites work @@
+Tough graphs and Hamiltonian circuits.
@@ Property / cites work: Tough graphs and Hamiltonian circuits. / rank @@
+Normal rank
@@ Property / cites work @@
+Long cycles in 4-connected planar graphs
@@ Property / cites work: Long cycles in 4-connected planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Combinatorial Decomposition Theory
@@ Property / cites work: A Combinatorial Decomposition Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian cycles in planar triangulations with no separating triangles
+Normal rank
@@ Property / cites work @@
+Q4390602
@@ Property / cites work: Q4390602 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-Hamiltonian cubic planar maps
@@ Property / cites work: Non-Hamiltonian cubic planar maps / rank @@
+Normal rank
@@ Property / cites work @@
+Q4842716
@@ Property / cites work: Q4842716 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3412151
@@ Property / cites work: Q3412151 / rank @@
+Normal rank
@@ Property / cites work @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+Q5547252
@@ Property / cites work: Q5547252 / rank @@
+Normal rank
@@ Property / cites work @@
+Polytopes, graphs, and complexes
@@ Property / cites work: Polytopes, graphs, and complexes / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of hamiltonian cycles in a maximal planar graph
+Normal rank
@@ Property / cites work @@
+Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs
+Normal rank
@@ Property / cites work @@
+Each maximal planar graph with exactly two separating triangles is Hamiltonian
+Normal rank
@@ Property / cites work @@
+Hamilton cycles in maximal planar graphs
@@ Property / cites work: Hamilton cycles in maximal planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Scattering number and extremal non-Hamiltonian graphs
+Normal rank
@@ Property / cites work @@
+The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
+Normal rank
@@ Property / cites work @@
+Some remarks on Jaeger's dual-hamiltonian conjecture
+Normal rank
@@ Property / cites work @@
+Hamilton cycles in plane triangulations
@@ Property / cites work: Hamilton cycles in plane triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+On a class of posets and the corresponding comparability graphs
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+-Connected Toroidal Graphs are Hamiltonian-Connected
+Normal rank
@@ Property / cites work @@
+Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem: An overview of exact and approximate algorithms
+Normal rank
@@ Property / cites work @@
+Q3834063
@@ Property / cites work: Q3834063 / rank @@
+Normal rank
@@ Property / cites work @@
+Simple paths on polyhedra
@@ Property / cites work: Simple paths on polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Q2799859
@@ Property / cites work: Q2799859 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5678882
@@ Property / cites work: Q5678882 / 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 @@
+Q4518404
@@ Property / cites work: Q4518404 / rank @@
+Normal rank
@@ Property / cites work @@
+-edge-Hamiltonian-connectedness of 4-connected plane graphs
+Normal rank
@@ Property / cites work @@
+Every 4-Connected Graph with Crossing Number 2 is Hamiltonian
+Normal rank
@@ Property / cites work @@
+Non-Hamiltonian triangulations with distant separating triangles
+Normal rank
@@ Property / cites work @@
+Q4044482
@@ Property / cites work: Q4044482 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3129827
@@ Property / cites work: Q3129827 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing 2-Walks in Polynomial Time
@@ Property / cites work: Computing 2-Walks in Polynomial Time / rank @@
+Normal rank
@@ Property / cites work @@
+-connected projective planar graphs are Hamiltonian
+Normal rank
@@ Property / cites work @@
+Planar and infinite hypohamiltonian and hypotraceable graphs
+Normal rank
@@ Property / cites work @@
+Q4146745
@@ Property / cites work: Q4146745 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar cubic hypohamiltonian and hypotraceable graphs
+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 @@
+On Hamiltonian Circuits
@@ Property / cites work: On Hamiltonian Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+A Theorem on Planar Graphs
@@ Property / cites work: A Theorem on Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bridges and Hamiltonian circuits in planar graphs
@@ Property / cites work: Bridges and Hamiltonian circuits in planar graphs / rank @@
+Normal rank