Hamiltonian connectivity of diagonal grid graphs

DOI10.33048/semi.2019.16.147zbMath1430.05071OpenAlexW3015591661MaRDI QIDQ2285212

A. L. Perezhogin, Nikolaĭ Vladimirovich Prytkov

Publication date: 16 January 2020

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.33048/semi.2019.16.147

zbMATH Keywords

grid graphHamiltonian connectivitydiscrete dynamic system

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• The Hamiltonian properties of supergrid graphs
• The Hamiltonian connectivity of rectangular supergrid graphs
• Identification of genetic networks by strategic gene disruptions and gene overexpressions under a Boolean model.
• The Functional Graph of a Linear Discrete Dynamical System with Two Dominating Vertices
• A discrete dynamical system on the double circulant
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hamiltonian connectivity of diagonal grid graphs