Abstract:We create and discuss several modifications to traditional graph coloring. 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.
Keywords: graph coloring, paths, conflict-free
AMS Subject Classification: 05C15 68R10