Work

Exact Independent Mutual-Visibility Chromatic Numbers of Strong Grid Graphs

Year: 2026
Type: preprint
Abstract: For all integers t ≥ r ≥ 3, this unrefereed preprint gives an exact independent mutual-visibility chromatic number for the strong path grid P_t ⊠ P_r: max{4, ceil(r/2)}. The lower bound, the even-palette full-width construction and widths 3–7 were established by Brešar, Peterin, Samadi and Yero (2026). The candidate contribution is an odd-palette construction and a common geodesic argument covering the remaining widths and justified restriction. An author-provided independent AI audit reports mathematical PASS; the author reports Windows finite reproduction PASS. Local Python path and independent BFS checks also passed. Human peer review and formal proof-assistant verification were not performed. Historical novelty INCONCLUSIVE; references PARTIAL. Copyright (c) 2026 Ryutaro Yonezu. All rights reserved.
Language: English
Open Access status: green
OpenAlex ID: W7236293010
Cites:
Cited by:
Related to: 10