期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2016
卷号：13
期号：1
页码：1-10
DOI：10.1016/j.akcej.2016.02.001
语种：English
出版社：Elsevier
摘要：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.
