Abstract
In another paper, L,3 the author has given a proof of a formula for M(λ), the number of ways of coloring a graph in λ colors, due to Birkhoff. The numbers m ij , in terms of which M(λ) is expressed, are here studied in detail; a method of calculating them is given.
Received February 16, 1932.—Presented to the American Mathematical Society, Oct. 25, 1930. This is, in revised form, from the author’s Harvard thesis. The section on recursion formulas has been left out; Part V has been added. An outline of the paper will be found in the Proceedings of the National Academy of Sciences, 17 (1931),pp. 122–125.
National Research Fellow.
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.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Birkhäuser Boston
About this chapter
Cite this chapter
Whitney, H. (1992). The Coloring Of Graphs. In: Eells, J., Toledo, D. (eds) Hassler Whitney Collected Papers. Contemporary Mathematicians. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-2972-8_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2972-8_5
Publisher Name: Birkhäuser Boston
Print ISBN: 978-1-4612-7740-8
Online ISBN: 978-1-4612-2972-8
eBook Packages: Springer Book Archive