Skip to main content
Log in

The numbers of labeled colored and chromatic trees

  • Published:
Acta Mathematica

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

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.


  1. E. T. Bell, Euler Algebra.Trans. Am. Math. Soc., 25 (1923), 135–154.

    Article  MATH  Google Scholar 

  2. L. Carlitz &J. Riordan, The number of labeled two-terminal series-parallel networks.Duke Math. Journal, 23 (1956), 435–446.

    Article  MathSciNet  Google Scholar 

  3. A. Cayley,Collected Mathematical Papers. Cambridge, 1889–1897; Vol. 3, 242–246; Vol. 9, 202–204, 427–460; Vol. 11, 365–367; Vol. 13, 26–28.

    Google Scholar 

  4. G. W. Ford &G. E. Uhlenbeck, Combinatorial problems in the theory of graphs. I.Proc. Nat. Acad. Sci. U.S.A., 42 (1956), 122–128.

    MathSciNet  Google Scholar 

  5. R. M. Foster, The number of series-parallel networks.Proceedings of the International Congress of Mathematicians (1950), Vol. I, 646.

    Google Scholar 

  6. F. Harary, The number of linear, directed, rooted, and connected graphs.Trans. Am. Math. Soc., 78 (1955), 445–463.

    Article  MATH  Google Scholar 

  7. R. Otter, The number of trees.Ann. of Math., 49 (1948), 583–599.

    Article  MATH  MathSciNet  Google Scholar 

  8. G. Pólya, Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen.Acta. Math., 68 (1937), 145–253.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations


Rights and permissions

Reprints and permissions

About this article

Cite this article

Riordan, J. The numbers of labeled colored and chromatic trees. Acta Math. 97, 211–225 (1957).

Download citation

  • Issue Date:

  • DOI: