Abstract
Let G,H be graphs, and P(G,λ), P(H,λ) be the chromatic polynomials of G,H respectively. Then G is chromatically equivalent to H, (written P 
H), if P(G,λ) = P(H,λ).
In this paper, we first state some open questions relating to chromatic equivalence of graphs, and then give non-trivial examples of chromatically equivalent graphs and their chromatic polynomials.
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
Bari, R., "Absolute Reducibility of Maps of at Most 19 Regions," Doctoral Dissertation, John Hopkins University, 1966.
Birkhoff, G. D. and Lewis, D. C., "Chromatic Polynomials," Trans. Amer. Math. Soc., 60, No. 3 (1946), 355–451.
Brylawski, T. A., "Reconstructing Combinatorial Geometries," this volume p. 226.
Harary, F., Graph Theory, Addison-Wesley, Reading, Mass., 1969.
Manvel, B, "Reconstruction of Unicyclic Graphs," Proof Techniques in Graph Theory (F. Harary, ed.) Academic Press, New York, 1969, 103–107.
Tutte, W. T., "On Chromatic Polynomials and the Golden Ratio," J. Combinatorial Theory 9, 290–296.
Whitney, H., "The Coloring of Graphs" Ann. of Math. 33 (1932) 688–718.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin
About this paper
Cite this paper
Bari, R.A. (1974). Chromatically equivalent graphs. In: Bari, R.A., Harary, F. (eds) Graphs and Combinatorics. Lecture Notes in Mathematics, vol 406. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066441
Download citation
DOI: https://doi.org/10.1007/BFb0066441
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06854-9
Online ISBN: 978-3-540-37809-9
eBook Packages: Springer Book Archive