List \(T\)-colorings of graphs
type: Item
instance of: scholarly article
title: List \(T\)-colorings of graphs
zbMATH Open document ID: 0788.05047
DOI: 10.1016/0166-218X(93)90015-G
author: Barry A. Tesman
published in: Discrete Applied Mathematics
publication date: 1994-05-15T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 474690
zbMATH Keywords: \(T\)-colouring
zbMATH Keywords: list
reviewed by: Jozef Fiamčík
MaRDI profile type: Publication
cites work: Q3697034
cites work: List-colourings of graphs
cites work: A new upper bound for the list chromatic number
cites work: A note on list-colorings
cites work: Q3322121
cites work: Q3340907
cites work: Q3922703
cites work: Incidence matrices and interval graphs
cites work: \(T\)-colorings of graphs: recent results and open problems
cites work: Q3487366
description: scientific article; zbMATH DE number 474690