Skip to main content
Log in

Chromatic polynomials of connected graphs

  • Published:
Archiv der Mathematik Aims and scope Submit manuscript

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. C.-Y. Chao andL.-C. Zhao, Chromatic polynomials of a family of graphs. Ars Combinatoria15, 111–129 (1983).

    Google Scholar 

  2. O.Ore, The four-color problem. New York 1967.

  3. R. C. Read, An introduction to chromatic polynomials. J. Comb. Theory4, 52–71 (1968).

    Google Scholar 

  4. E. G.Whitehead, Jr., and L.-C.Zhao, Cutpoints and the chromatic polynomial. To appear in J. Graph Theory.

  5. H. Whitney, The coloring of graphs. Ann. of Math.73, 688–718 (1932).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was done, while the author was a visiting scholar at the University of Pittsburgh.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chao, CY., Zhao, LC. Chromatic polynomials of connected graphs. Arch. Math 43, 187–192 (1984). https://doi.org/10.1007/BF01193920

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation