On a generalized family of colorings (Q752722)

From MaRDI portal
Revision as of 11:19, 16 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: reviewed by (P1447): Item:Q587976)
scientific article
Language Label Description Also known as
English
On a generalized family of colorings
scientific article

    Statements

    On a generalized family of colorings (English)
    0 references
    0 references
    1990
    0 references
    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.
    0 references
    call chromatic number
    0 references
    bounds
    0 references
    colouring algorithms
    0 references

    Identifiers