Abstract
Let G be a finite simple graph. Suppose that to each vertex v ∈ V(G) there is assigned a finite set (or “list”) C(v) of colours (or “symbols”). The general problem is: what conditions on G and the colour-set assignment C guarantee that the vertices of G can be coloured so that each v ∈ V(G) is coloured with a colour from C(v), and adjacent vertices are coloured differently? Such a colouring of V(G) will be called a C-colouring of G.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Behzad, G. Chartrand, and L. Lesniak-Foster, Graphs and Digraphs, Prindle, Weber & Schmidt, Boston, 1979.
A. Chetwynd and R. Häggkvist, A note on list-colourings, Report, Department of Mathematics, University of Stockholm, 1986, no. 17.
B. Bollobâs and A.J. Harris, List-colourings of graphs, Graphs and Combinatorics 1 (1985), 115–127.
P. Erdös, A. Rubin, and H. Taylor, Choosability in graphs, (Proc. West Coast Conf. on Combinatorics, Arcata, Humboldt State University, 1979) Congressus Numerantium 26 (1979), 125–157.
P. Hall, On representatives of subsets, Jour. London Math. Soc. 10 (1935), 26–30.
A.J.W. Hilton and P.D. Johnson Jr., Ryser’s theorem and the list-colouring conjecture, Research Notes in Mathematics (Pitman), to appear.
H. Ryser, A combinatorial theorem with an application to Latin rectangles, Proc. Amer. Math. Soc. 2 (1951), 550–552.
H. Ryser, Combinatorial Mathematics, Carus Monograph, The Mathematical Association of America, John Wiley, 1963.
B. Toft, 75 Graph Colouring Problems, presented at the Open University one-day conference, 9 December 1988; Mathematics and Computer Science, Odense University, DK-5230 Odense M, Denmark.
V.G. Vizing, Colouring the vertices of a graph in prescribed colours (Russian), Diskret. Analiz. No. 29 Metody Diskret. Anal. V Teorii Kodov i Shem (1976) 3–10, 101 (MR58 16371).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Physica-Verlag Heidelberg
About this chapter
Cite this chapter
Hilton, A.J.W., Johnson, P.D. (1990). Extending Hall’s Theorem. In: Bodendiek, R., Henn, R. (eds) Topics in Combinatorics and Graph Theory. Physica-Verlag HD. https://doi.org/10.1007/978-3-642-46908-4_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-46908-4_41
Publisher Name: Physica-Verlag HD
Print ISBN: 978-3-642-46910-7
Online ISBN: 978-3-642-46908-4
eBook Packages: Springer Book Archive