Abstract
We create and discuss several modifications to traditional graph color- ing. In particular, we classify various notions of coloring in a proper hierarchy. We concentrate on grid graphs whose colorings can be represented by natural number entries in arrays with various restrictions.
| Original language | English |
|---|---|
| Pages (from-to) | 469-480 |
| Number of pages | 12 |
| Journal | Commentationes Mathematicae Universitatis Carolinae |
| Volume | 51 |
| Issue number | 3 |
| State | Published - 1 Jan 2010 |
Keywords
- Conflict-free
- Graph coloring
- Paths
ASJC Scopus subject areas
- General Mathematics