Skip to main content

Coloring seven-circuits

  • Part III: Contributed Papers New Results On Graphs And Combinatorics
  • Conference paper
  • First Online:
Graphs and Combinatorics

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

  • 2557 Accesses

Abstract

Recent work of Beraha, Hall, and Tutte has made it clear that it is interesting to express the constrained chromials of planar graphs containing an open n-circuit in terms of free chromials. This problem was solved for n = 4 and n = 5, and a partial solution given for n = 6 by Birkhoff and Lewis. The solution for the case n = 6 was completed by Hall and Lewis. There are 162 constrained chromials for the seven circuit. One of these has all 7 colors different, the remaining 161 divide themselves into 23 groups of seven each. The sum of the constrained chromials in each of these 23 groups is called a constrained rochromial. The sum of the corresponding 7 free chromials in each group is called a free rochromial. Equations are obtained expressing each of the constrained rochromials in terms of free rochromials. A new Beraha number appears exactly where it should.

This paper was partially supported by grants from the SUNY Research Foundation

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Birkhoff, George D. and Lewis, D. C., "Chromatic polvnomials", Trans. A.M.S. 60 (1946), 355–451.

    MathSciNet  MATH  Google Scholar 

  2. Hall, D. W., and Lewis, D. C., "Coloring six-rings", Trans. A.M.S. 64 (1948), 184–191.

    Article  MathSciNet  MATH  Google Scholar 

  3. Hall, D. W., Siry, J. W., and Vanderslice, B. R., "The chromatic polynomial of the truncated icosahedron", Proc. A.M.S. 16 (1965), 620–628.

    Article  MathSciNet  MATH  Google Scholar 

  4. Hills, F. D., "Chromials of n-circuits, 4 ≤ n ≤ 7," Master's thesis, SUNY at Binghamton, 1973.

    Google Scholar 

  5. Rector, R. W., "Fundamental linear relationships for the seven-ring", Doctoral Dissertation, University of Maryland, 1956.

    Google Scholar 

  6. Tutte, W. T., "On chromatic polynomials and the golden ratio", J. Combinatorial Theory 9 (1970), 289–296.

    Article  MathSciNet  MATH  Google Scholar 

  7. Tutte, W. T., "More about chromatic polynomials and the golden ratio", Combinatorial Structures and their Applications, (R.K. Guy, ed.) Gordon and Breach, New York, 1970, 439–453.

    Google Scholar 

  8. Tutte, W. T., "Chromatic sums for planar triangulations, V: Special equations", Department of Combinatorics and Optimization, University of Waterloo, Research Report CORR 73-2, January 23, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ruth A. Bari Frank Harary

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin

About this paper

Cite this paper

Hall, D.W. (1974). Coloring seven-circuits. In: Bari, R.A., Harary, F. (eds) Graphs and Combinatorics. Lecture Notes in Mathematics, vol 406. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066449

Download citation

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

  • 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

Publish with us

Policies and ethics