Skip to main content

On chromatic equivalence of graphs

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

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   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.00
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. D. Geller and B. Manvel, "Reconstruction of Cacti," Canadian J. Math. 21 (1969), 1354–1360.

    CrossRef  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  3. C. Jordan, Calculus of Finite Differences, Chelsea, 1947 (Second Ed.).

    Google Scholar 

  4. L. A. Lee, On Chromatically Equivalent Graphs, Doctoral Dissertation, George Washington University, 1975.

    Google Scholar 

  5. R. C. Read, "An Introduction to Chromatic Polynomials," J. Combinatorial Theory 4, (1968), 52–71.

    CrossRef  MathSciNet  Google Scholar 

  6. J. Riordan, Combinatorial Identities, Wiley, New York, 1968.

    MATH  Google Scholar 

  7. G. C. Rota and R. Mullin, "On the Foundations of Combinatorial Theory," B. Harris (ed.) Graph Theory and Its Applications, Academic Press, 1970.

    Google Scholar 

  8. N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973.

    Google Scholar 

  9. W. T. Tutte, "On Chromatic Polynomials and the Golden Ratio," J. Combinatorial Theory 9, (1970), 289–296.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. H. Whitney, "A Logical Expansion in Mathematics," Bull. Amer. Math. Soc. 38 (1932), 572–579.

    CrossRef  MathSciNet  Google Scholar 

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

    CrossRef  MathSciNet  Google Scholar 

  12. A. A. Zykov, "On Some Properties of Linear Complexes," Amer. Math. Soc. Transl. No. 79 (1952); translated from Mat. Sb. 24, No. 66 (1949), 163–188.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chao, CY., Whitehead, E.G. (1978). On chromatic equivalence of graphs. In: Alavi, Y., Lick, D.R. (eds) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0070369

Download citation

  • DOI: https://doi.org/10.1007/BFb0070369

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08666-6

  • Online ISBN: 978-3-540-35912-8

  • eBook Packages: Springer Book Archive