Hamiltonian properties of triangular grid graphs
From MaRDI portal
Publication:998354
DOI10.1016/j.disc.2007.11.040zbMath1158.05040OpenAlexW2091151333WikidataQ57633903 ScholiaQ57633903MaRDI QIDQ998354
Frank Werner, Yury L. Orlovich, Valery S. Gordon
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.040
Biochemistry, molecular biology (92C40) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Eulerian and Hamiltonian graphs (05C45)
Related Items (24)
Domination with decay in triangular matchstick arrangement graphs ⋮ Hamilton-connectivity of line graphs with application to their detour index ⋮ Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications ⋮ Hamiltonian cycles in linear-convex supergrid graphs ⋮ Unnamed Item ⋮ Word-representability of face subdivisions of triangular grid graphs ⋮ A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole ⋮ The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs ⋮ 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids ⋮ 2-Trees: Structural insights and the study of Hamiltonian paths ⋮ A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes ⋮ Restrained domination and its variants in extended supergrid graphs ⋮ Hamiltonian paths in some classes of grid graphs ⋮ Hamiltonian properties of locally connected graphs with bounded vertex degree ⋮ Longest (s, t)-paths in L-shaped grid graphs ⋮ Not being (super)thin or solid is hard: A study of grid Hamiltonicity ⋮ The Hamiltonian properties of supergrid graphs ⋮ The Hamiltonian connectivity of rectangular supergrid graphs ⋮ The Hamilton cycle problem for locally traceable and locally Hamiltonian graphs ⋮ Hamiltonian paths in \(L\)-shaped grid graphs ⋮ Efficient \(( t , r )\) broadcast dominating sets of the triangular lattice ⋮ An Improved Strategy for Exploring a Grid Polygon ⋮ Many-to-many two-disjoint path covers in cylindrical and toroidal grids ⋮ The complexity of quantum circuit mapping with fixed parameters
Cites Work
- Extending cycles in graphs
- Claw-free graphs---a survey
- Hamiltonian cycles in T-graphs
- A strengthening of Kikustapos;s theorem
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Locally connected graphs
- Hamilton Paths in Grid Graphs
- Channel assignment and multicolouring of the induced subgraphs of the triangular lattice
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Hamiltonian properties of triangular grid graphs
