A proof of a conjecture on multiset coloring the powers of cycles☆
Highlights
► We give a proof to the conjecture on multiset coloring the powers of cycles. ► We prove that two colors are not enough for multiset coloring (, ). ► Frobenius number is used in the proof of the conjecture.
References (6)
- et al.
Representations of integers by linear forms in nonnegative integers
J. Number Theory
(1972) - et al.
Recognizable colorings of graphs
Discuss. Math. Graph Theory
(2008) - et al.
The multiset chromatic number of a graph
Math. Bohem.
(2009)
There are more references available in the full text version of this article.
Cited by (2)
On the neighbor sum-distinguishing vertex coloring of a graph
2016, Journal of Combinatorial Mathematics and Combinatorial ComputingOn multiset colorings of generalized corona graphs
2016, Mathematica Bohemica
Copyright © 2012 Elsevier B.V. All rights reserved.