Hamiltonian properties of polyhedra with few 3-cuts. A survey
type: Item
instance of: scholarly article
title: Hamiltonian properties of polyhedra with few 3-cuts. A survey
zbMATH Open document ID: 1392.05066
author: Kenta Ozeki
author: Carol T. Zamfirescu
author: Nico Van Cleemput
published in: Discrete Mathematics
publication date: 2018-07-26T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6910648
zbMATH Keywords: planar graph
zbMATH Keywords: 3-connected graph
zbMATH Keywords: polyhedron
zbMATH Keywords: triangulation
zbMATH Keywords: decomposition tree
zbMATH Keywords: Hamiltonian
zbMATH Keywords: traceable
zbMATH Keywords: Hamiltonian-connected
MaRDI profile type: Publication
full work available at URL: j.disc.2018.06.015
OpenAlex ID: W2811004539
cites work: Chordal and timbral morphologies using Hamiltonian cycles
cites work: Cycles through 23 vertices in 3-connected cubic planar graphs
cites work: Nonhamiltonian 3-Connected Cubic Planar Graphs
cites work: A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
cites work: On Hamiltonian cycles in 4- and 5-connected plane triangulations
cites work: Q4882477
cites work: On certain Hamiltonian cycles in planar graphs
cites work: On the strongest form of a theorem of Whitney for Hamiltonian cycles in plane triangulations
cites work: On the number of hamiltonian cycles in triangulations with few separating triangles
cites work: Polyhedra with few 3-cuts are Hamiltonian
cites work: Any maximal planar graph with only one separating triangle is Hamiltonian
cites work: Cycles in 4-connected planar graphs
cites work: A theorem on paths in planar graphs
cites work: The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
cites work: Tough graphs and Hamiltonian circuits.
cites work: Long cycles in 4-connected planar graphs
cites work: A Combinatorial Decomposition Theory
cites work: Hamiltonian cycles in planar triangulations with no separating triangles
cites work: Q4390602
cites work: Non-Hamiltonian cubic planar maps
cites work: Q4842716
cites work: Q3412151
cites work: The Planar Hamiltonian Circuit Problem is NP-Complete
cites work: Q5547252
cites work: Polytopes, graphs, and complexes
cites work: On the number of hamiltonian cycles in a maximal planar graph
cites work: Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs
cites work: Each maximal planar graph with exactly two separating triangles is Hamiltonian
cites work: Hamilton cycles in maximal planar graphs
cites work: Scattering number and extremal non-Hamiltonian graphs
cites work: The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
cites work: Some remarks on Jaeger's dual-hamiltonian conjecture
cites work: Hamilton cycles in plane triangulations
cites work: On a class of posets and the corresponding comparability graphs
cites work: Reducibility among Combinatorial Problems
cites work: 5-Connected Toroidal Graphs are Hamiltonian-Connected
cites work: Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
cites work: The traveling salesman problem: An overview of exact and approximate algorithms
cites work: Q3834063
cites work: Simple paths on polyhedra
cites work: Book embedding of projective-planar graphs
cites work: Q5678882
cites work: A 1-tough nonhamiltonian maximal planar graph
cites work: Q4518404
cites work: 2-edge-Hamiltonian-connectedness of 4-connected plane graphs
cites work: Every 4-Connected Graph with Crossing Number 2 is Hamiltonian
cites work: Non-Hamiltonian triangulations with distant separating triangles
cites work: Q4044482
cites work: Q3129827
cites work: Computing 2-Walks in Polynomial Time
cites work: 4-connected projective planar graphs are Hamiltonian
cites work: Planar and infinite hypohamiltonian and hypotraceable graphs
cites work: Q4146745
cites work: Planar cubic hypohamiltonian and hypotraceable graphs
cites work: On Hamiltonian Circuits

Hamiltonian properties of polyhedra with few 3-cuts. A survey (cites work)
cites work: A Theorem on Planar Graphs

Hamiltonian properties of polyhedra with few 3-cuts. A survey (cites work)
cites work: Bridges and Hamiltonian circuits in planar graphs

Hamiltonian properties of polyhedra with few 3-cuts. A survey (Wikidata QID)
Wikidata QID: Q129606207

Hamiltonian properties of polyhedra with few 3-cuts. A survey (DOI)
DOI: 10.1016/J.DISC.2018.06.015