Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/oxford-university-press/an-upper-bound-for-list-t-colourings-57TRWhWxde
References (8)
-
(1991)
recent results and open problems', Discrete Math -
Barry Tesman (1993)
List T-Colorings of GraphsDiscret. Appl. Math., 45
-
(1980)
theory and applications', Proc -
(1976)
VIZING, 'Colouring the vertices of a graph in prescribed colours' (Russian), Diskret. Analiz -
(1979)
Choosability in graphs -
F. Roberts (1991)
T-colorings of graphs: recent results and open problemsDiscret. Math., 93
-
(1976)
Colouring the vertices of a graph in prescribed colours' (Russian), Diskret. Analiz. No. 29, Metody Diskret -
W. Hale (1980)
Frequency assignment: Theory and applicationsProceedings of the IEEE, 68
- Publisher
- Oxford University Press
- Copyright
- © London Mathematical Society
- ISSN
- 0024-6093
- eISSN
- 1469-2120
- DOI
- 10.1112/blms/28.4.337
- Publisher site
- See Article on Publisher Site
Abstract
Abstract Erdős, Rubin and Taylor showed in 1979 that for any connected graph G which is not a complete graph or an odd cycle, ch(G) ≤ Δ, where Δ is the maximum degree of a vertex in G and ch(G) is the choice number of the graph (also proved by Vizing in 1976). They also gave a characterisation of D-choosability. A graph G is D-choosable if, when we assign to each vertex v of G a list containing d(v) elements, where d(v) is the degree of vertex v, we can always choose a proper vertex colouring from these lists, however the lists were chosen. In this paper we shall generalise their results on the choice number of G and D-choosability to the case where we have T-colourings. © London Mathematical Society
Journal
Bulletin of the London Mathematical Society – Oxford University Press
Published: Jun 1, 1996