Skip to main content

Chromatically equivalent graphs

Part III: Contributed Papers New Results On Graphs And Combinatorics

Part of the Lecture Notes in Mathematics book series (LNM,volume 406)

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, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bari, R., "Absolute Reducibility of Maps of at Most 19 Regions," Doctoral Dissertation, John Hopkins University, 1966.

    Google Scholar 

  2. Birkhoff, G. D. and Lewis, D. C., "Chromatic Polynomials," Trans. Amer. Math. Soc., 60, No. 3 (1946), 355–451.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. Brylawski, T. A., "Reconstructing Combinatorial Geometries," this volume p. 226.

    Google Scholar 

  4. Harary, F., Graph Theory, Addison-Wesley, Reading, Mass., 1969.

    Google Scholar 

  5. Manvel, B, "Reconstruction of Unicyclic Graphs," Proof Techniques in Graph Theory (F. Harary, ed.) Academic Press, New York, 1969, 103–107.

    Google Scholar 

  6. Tutte, W. T., "On Chromatic Polynomials and the Golden Ratio," J. Combinatorial Theory 9, 290–296.

    Google Scholar 

  7. Whitney, H., "The Coloring of Graphs" Ann. of Math. 33 (1932) 688–718.

    CrossRef  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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