1. Puzzling and apuzzling graphs
- Author
-
Daphne Gold, James Henle, Cherry Huang, Tia Lyve, Tara Marin, Jasmine Osorio, Mäneka Puligandla, Bayla Weick, Jing Xia, He Yun, and Jize Zhang
- Subjects
Vertex coloring ,Puzzles ,Partitions ,Mathematics ,QA1-939 - Abstract
Let G be a graph with chromatic number χ(G) and consider a partition P of G into connected subgraphs. P is a puzzle on G if there is a unique vertex coloring of G using 1, 2, …, χ(G) such that the sums of the numbers assigned to the partition pieces are all the same. P is an apuzzle if there is a unique vertex coloring such that the sums are all different. We investigate the concept of puzzling and apuzzling graphs, detailing classes of graphs that are puzzling, apuzzling and neither.
- Published
- 2016
- Full Text
- View/download PDF