Coloring subgraphs with restricted amounts of hues
We consider vertex colorings where the number of colors given to specified subgraphs is restricted. In particular, given some fixed graph F and some fixed set A of positive integers, we consider (not necessarily proper) colorings of the vertices of a graph G such that, for every copy of F in G, the...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2017-09-01
|
| Series: | Open Mathematics |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/math-2017-0098 |