On multiset colorings of generalized corona graphs
A vertex $k$-coloring of a graph $G$ is a \emph{multiset $k$-coloring} if $M(u)\neq M(v)$ for every edge $uv\in E(G)$, where $M(u)$ and $M(v)$ denote the multisets of colors of the neighbors of $u$ and $v$, respectively. The minimum $k$ for which $G$ has a multiset $k$-coloring is the \emph{multiset...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics of the Czech Academy of Science
2016-12-01
|
| Series: | Mathematica Bohemica |
| Subjects: | |
| Online Access: | http://mb.math.cas.cz/full/141/4/mb141_4_2.pdf |