Skip to content

All Polyominoes are C4-face-magic

Parikshit Chalise, Richard M. Low, Arman Eisenkolb-Vaithyanathan

math.COarXiv:2608.08914

Abstract

For a planar graph G = (V, E) embedded in R2, let F(G) denote the set of faces of G. Then G is called a Cn-face-magic graph if there exists a bijection f: V(G) \1, 2, …, |V(G)|\ such that for any F ∈ F(G) with F Cn, the sum of all the vertex labels along Cn is a constant c. In this paper, we prove that all polyominoes are C4-face-magic.

Create a lesson