On a generalized family of colorings (Q752722): Difference between revisions

By a graph \(G=(V,E)\) we mean the vertex set V corresponded to the cells (in telecommunication technology) and the edges in E connected neighbouring cells with the metric induced by the shortest path between vertices. The call chromatic number \(C^ f_ R(G)\) of G consists in assigning f(x) colours (frequencies) to each vertex x in V with the constraint that within any ball (x,R) of radius \(R>0\), all colours are different. There are given bounds and colouring algorithms of \(C^ f_ R(G)\) for trees, n-cycles, hypercubes, square and triangular lattices respectively. Some generalizations, a connection to Heawood's map colour theorem and open problems are considered too.