The multiset chromatic number of a graph

DOI10.21136/mb.2009.140654zbMath1212.05071OpenAlexW16531662MaRDI QIDQ3588873

Ebrahim Salehi, Ping Zhang, Gary Chartrand, Futaba Okamoto

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)

Related Items (2)

On the complexity of gap-\([2\)-vertex-labellings of subcubic bipartite graphs] ⋮ 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