A proof of a conjecture on multiset coloring the powers of cycles

DOI10.1016/j.ipl.2012.06.004zbMath1248.05064OpenAlexW2005140353WikidataQ123149267 ScholiaQ123149267MaRDI QIDQ456085

Yun Feng, Wensong Lin

Publication date: 23 October 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.06.004

zbMATH Keywords

combinatorial problemsFrobenius numbermultiset chromatic numbermultiset coloringneighbor-distinguishing coloringthe powers of cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Representations of integers by linear forms in nonnegative integers
• On multiset colorings of graphs
• Recognizable colorings of graphs
• The multiset chromatic number of a graph

This page was built for publication: A proof of a conjecture on multiset coloring the powers of cycles