Izvorni znanstveni članak
https://doi.org/10.64785/mc.31.1.1
On a conjecture of McNeil
Sela Fried
orcid.org/0000-0002-1547-4925
; Department of Computer Science, Israel Academic College, Ramat Gan, Israel
*
* Dopisni autor.
Sažetak
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}) .
Ključne riječi
graph labeling; grid graph; Manhattan distance; permutation
Hrčak ID:
345974
URI
Datum izdavanja:
2.4.2026.
Posjeta: 0 *