The multiset chromatic number of a graph.

DOI10.21136/MB.2009.140654MaRDI QIDQ3588873zbMATH OpenOpenAlexFDO

Authors Gary Chartrand, Futaba Okamoto, Ebrahim Salehi, Ping Zhang

Publication date 10 September 2010

Full work available at URL https://eudml.org/doc/38086

zbMATH Keywords

vertex coloringmultiset chromatic numbermultiset coloringneighbor-distinguishing coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On multiset colorings of graphs
• A proof of a conjecture on multiset coloring the powers of cycles
• On multiset colorings of generalized corona graphs.
• scientific article; zbMATH DE number 6531808
• A general edge-coloring of \(mP_n\) which is vertex distinguished by multisets

Cited in

(4)

• On multiset colorings of generalized corona graphs.
• On the complexity of gap-\([2]\)-vertex-labellings of subcubic bipartite graphs
• Multicoloring of graphs to secure a secret
• A proof of a conjecture on multiset coloring the powers of cycles

This page was built for publication: The multiset chromatic number of a graph.

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