Skip to main content
Log in

On trees of polygons

  • 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 and E. G.Whitehead, Jr., On chromatic equivalence of graphs, Theory and Applications of Graphs. Eds: Y. Alavi and D. R. Lick; LNM642, 121–131, Berlin-Heidelberg-New York 1978.

  2. C.-Y. Chao andL.-C. Zhao, Chromatic polynomials of connected graphs. Arch. Math.43, 187–192 (1984).

    Google Scholar 

  3. E. J. Farrell, On chromatic coefficients. Discrete Math.4, 257–264 (1980).

    Google Scholar 

  4. K. Kuratowski, Sur le problem des courbes gauches en topologie. Fund. Math.16, 271–283 (1930).

    Google Scholar 

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

    Google Scholar 

  6. E. G.Whitehead, Jr., Chromaticity of two-trees. To appear in J. Graph Theory.

  7. H. Whitney, The coloring of graphs. Ann. of Math.33, 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., Li, NZ. On trees of polygons. Arch. Math 45, 180–185 (1985). https://doi.org/10.1007/BF01270490

Download citation

  • Received:

  • Issue Date:

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

Navigation