Chromatic Spectrum of $K_s$-WORM Colorings of $K_n$
An {\it $H$-WORM} coloring of a simple graph $G$ is the coloring of the vertices of $G$ such that no copy of $H\subseteq G$ is monochrome or rainbow. In a recently published article by one of the authors \cite{All1}, it was claimed that the number of $r$-partitions in a $K_s$-WORM coloring of $K_n...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
2020-09-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v28-n2/v28-n2-(pp170-186).pdf |