Skip to the main content

Original scientific paper

https://doi.org/10.64785/mc.31.1.1

On a conjecture of McNeil

Sela Fried orcid id orcid.org/0000-0002-1547-4925 ; Department of Computer Science, Israel Academic College, Ramat Gan, Israel *

* Corresponding author.


Full text: english pdf 322 Kb

page 1-10

downloads: 55

cite


Abstract

We determine the maximum length of a walk on the grid graph \( 𝑃_{m} × 𝑃_{n}), up to an additive error of 1. This
nearly settles McNeil’s conjecture for the square grid graph \( 𝑃_{m} × 𝑃_{n}) .

Keywords

graph labeling; grid graph; Manhattan distance; permutation

Hrčak ID:

345974

URI

https://hrcak.srce.hr/345974

Publication date:

2.4.2026.

Visits: 190 *