All Polyominoes are C4-face-magic
Parikshit Chalise, Richard M. Low, Arman Eisenkolb-Vaithyanathan
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
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato