Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths

DOI10.1002/mma.3301zbMath1330.92137arXiv1502.03037OpenAlexW1718026281MaRDI QIDQ3467125

Arni S. R. Srinivasa Rao, Damer Blake, Fiona Tomley

Publication date: 26 January 2016

Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.03037

zbMATH Keywords

NP-completelongest paths\textit{Eimeria}maximum walksspread of bird diseases

Mathematics Subject Classification ID

Epidemiology (92D30) Applications of graph theory (05C90) Animal behavior (92D50) Random walks on graphs (05C81)

Related Items

A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole, Longest (s, t)-paths in L-shaped grid graphs, Hamiltonian paths in \(L\)-shaped grid graphs, Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs

Cites Work

• Unnamed Item
• Hamiltonian paths in some classes of grid graphs
• Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
• On approximating the longest path in a graph
• Approximating the longest paths in grid graphs
• A linear-time algorithm for the longest path problem in rectangular grid graphs
• Trees in sparse random graphs
• The longest path in a random graph
• Reconstruction of infinite graphs
• Hamiltonian paths in infinite graphs
• Reconstructing infinite graphs
• A matrix method for counting Hamiltonian cycles on grid graphs
• Longest cycles in sparse random digraphs
• Embedding Spanning Trees in Random Graphs
• Approximating the Longest Cycle Problem in Sparse Graphs
• A Problem in Graph Theory
• Rectifiable Curves and the Weierstrass Integral
• Note on Hamilton Circuits
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Random Graph With a Subcritical Number of Edges
• Hamiltonian Properties of Grid Graphs
• A Search Procedure for Hamilton Paths and Circuits
• Hamiltonian Tours and Paths in Rectangular Lattice Graphs
• Hamilton Paths in Grid Graphs
• Infinite graphs—A survey
• A note on K-path hamiltonian graphs