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

DOI10.1016/J.IPL.2012.06.004zbMATH Open1248.05064OpenAlexW2005140353WikidataQ123149267 ScholiaQ123149267MaRDI QIDQ456085FDOQ456085

Authors: 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

Recommendations

• The multiset chromatic number of a graph.
• On multiset colorings of graphs
• A result on the total colouring of powers of cycles
• Compositions, decompositions, and conformability for total coloring on power of cycle graphs
• On multiset colorings of generalized corona graphs.

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• 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.

Cited In (2)

• A simple proof of the multiplicativity of directed cycles of prime power length
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456085)