Abstract
The chromial or chromatic polynomial of a finite graph G is a polynomial P(G,λ) in a variable λ with the following property: the value of P(G,λ) when λ is a positive integer is the number of ways of colouring G in λ colours. In this paper various properties of the chromial, considered as a function of a real variable λ, are discussed.
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.
References
G. D. Birkhoff and D. C. Lewis, Chromatic polynomials, Trans. Amer. Math. Soc. 60 (1946), 355–451.
W. T. Tutte, On chromatic polynomials and the golden ratio, J. Combinatorial Theory 9(1970), 289–296.
W. T. Tutte, The golden ratio in the theory of chromatic polynomials, Annals of the New York Academy of Sciences, 175 (1970), 391–402.
W. T. Tutte, Chromatic sums for rooted planar triangulations, V: special equations, Canadian J. Math. To appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag
About this paper
Cite this paper
Tutte, W.T. (1975). The graph of the chromial of a graph. In: Street, A.P., Wallis, W.D. (eds) Combinatorial Mathematics III. Lecture Notes in Mathematics, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0069543
Download citation
DOI: https://doi.org/10.1007/BFb0069543
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07154-9
Online ISBN: 978-3-540-37482-4
eBook Packages: Springer Book Archive