The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs

DOI10.1007/s40840-023-01499-xzbMath1518.05101OpenAlexW4366823933MaRDI QIDQ6102214

Alireza Bagheri, Fatemeh Keshavarz-Kohjerdi

Publication date: 8 May 2023

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-023-01499-x

zbMATH Keywords

Hamiltonian cycleHamiltonian path3-connected graphHamiltonian-connectedsolid supergrid graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian cycles in linear-convex supergrid graphs
• The Hamiltonian properties of supergrid graphs
• Not being (super)thin or solid is hard: A study of grid Hamiltonicity
• Hamiltonian properties of triangular grid graphs
• Survey on path and cycle embedding in some networks
• Hamiltonian cycles in T-graphs
• An efficient algorithm for constructing Hamiltonian paths in meshes
• The Hamiltonian connectivity of rectangular supergrid graphs
• Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs
• A condition on Hamilton-connected line graphs
• Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs
• Reconfiguring Hamiltonian cycles in L-shaped grid graphs
• A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole
• Hamilton Paths in Grid Graphs
• Off-line exploration of rectangular cellular environments with a rectangular obstacle
• Computing and Combinatorics
• Hamiltonian paths in \(L\)-shaped grid graphs

This page was built for publication: The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs