Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4646512 | AKCE International Journal of Graphs and Combinatorics | 2016 | 10 Pages |
Abstract
Let GG be a graph with chromatic number χ(G)χ(G) and consider a partition PP of GG into connected subgraphs. PP is a puzzle on GG if there is a unique vertex coloring of GG using 1, 2, …, χ(G)χ(G) such that the sums of the numbers assigned to the partition pieces are all the same. PP 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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Daphne Gold, James Henle, Cherry Huang, Tia Lyve, Tara Marin, Jasmine Osorio, Mäneka Puligandla, Bayla Weick, Jing Xia, He Yun, Jize Zhang,