This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliografia
P. Erdős, A. L. Rubin & H. Taylor: Choosability in graphs, Proc. West Coast Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium 26 (1979), 125–157.
D. Gale & L. S. Shapley: College admissions and the stability of marriage, Amer. Math. Monthly 69 (1962), 9–15.
F. Galvin: The list chromatic index of a bipartite multigraph, J. Combinatorial Theory, Ser. B 63 (1995), 153–158.
J. C. M. Janssen: The Dinitz problem solved for rectangles, Bulletin Amer. Math. Soc. 29 (1993), 243–249.
V. G. Vizing: Coloring the vertices of a graph in prescribed colours (in Russian), Metody Diskret. Analiz. 101 (1976), 3–10.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Italia, Milano
About this chapter
Cite this chapter
(2006). Il problema di Dinitz. In: Quarteroni, A. (eds) Proofs from THE BOOK. Springer, Milano. https://doi.org/10.1007/88-470-0451-9_28
Download citation
DOI: https://doi.org/10.1007/88-470-0451-9_28
Publisher Name: Springer, Milano
Print ISBN: 978-88-470-0435-1
Online ISBN: 978-88-470-0451-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)