Two New Classes of Hamiltonian Graphs

DOI10.1016/J.ENDM.2007.07.090MaRDI QIDQ3503520zbMATH OpenOpenAlexFDO

Authors Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk

Publication date 5 June 2008

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2007.07.090

zbMATH Keywords

Hamiltonian cyclegirthgrid graph

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Distance in graphs (05C12) Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 5543678
• Hamiltonian properties of triangular grid graphs
• Not being (super)thin or solid is hard: A study of grid Hamiltonicity
• The Hamilton circuit problem on grids
• ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS

Cites work

• Hamilton Paths in Grid Graphs
• On two geometric problems related to the travelling salesman problem
• Two New Classes of Hamiltonian Graphs

Cited in

(8)

• Boundary properties of graphs for algorithmic graph problems
• The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle.
• scientific article; zbMATH DE number 5239029 (Why is no real title available?)
• Finding Hamiltonian cycles in certain planar graphs
• Two segment classes with Hamiltonian visibility graphs
• Topological graph theory on vox-solids
• Two New Classes of Hamiltonian Graphs
• Not being (super)thin or solid is hard: A study of grid Hamiltonicity

This page was built for publication: Two New Classes of Hamiltonian Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503520)