List \(T\)-colorings of graphs (Q1309815)

From MaRDI portal
Revision as of 11:04, 22 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
List \(T\)-colorings of graphs
scientific article

    Statements

    List \(T\)-colorings of graphs (English)
    0 references
    0 references
    15 May 1994
    0 references
    Given a set \(T\) and an integer \(k\), a graph \(G\) is \(T-k\) choosable if, for every assignment of (possibly different) lists of \(k\) integers to the vertices of \(G\), there exists a \(T\)-colouring of \(G\) colouring each vertex with an element from the list assigned to that vertex. Exact values and bounds on the smallest \(k\) needed to be \(T-k\) choosable are presented for chordal graphs, complete (bipartite) graphs, trees and \(T\) sets. \(T-k\) choosability has highly interesting applications in radio and television frequency assignment.
    0 references
    \(T\)-colouring
    0 references
    list
    0 references

    Identifiers