Skip to main content
SpringerLink
Log in

Bewertete Bäume

  • 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

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Literaturverzeichnis

  1. R. Duke, Can the complete graph with 2n+1 vertices be packed with copies of an arbitrary tree havingn edges? Amer. Math. Monthly76, 1128–1130 (1969).

    Google Scholar 

  2. R. Guy andV. Klee, Monthly Research Problems 1969–71. Amer. Math. Monthly78, 1113–1122 (1971).

    Google Scholar 

  3. G. Haggard andP. McWha, Decomposition of complete graphs into trees. Czech. Math. J.25 (100), 31–36 (1975).

    Google Scholar 

  4. A.Rosa, On certain valuations of the vertices of a graph. In: Proc. Intern. Symp. Rome July 1966, 349–355. New York 1967.

  5. G.Ringel, Problem 25, Theory of graphs and its applications. In: Proc. Symp. Smolenice June 1963, 162. Prague 1963.

Download references

Author information

Author notes

  1. Norbert Köhler

    Present address: Fachbereich Mathematik, Technische Universität Berlin, Straße des 17 Juni 135, D-1000, Berlin 12

Authors and Affiliations

    Authors
    1. Norbert Köhler
      View author publications

      You can also search for this author in PubMed Google Scholar

    Rights and permissions

    Reprints and permissions

    About this article

    Cite this article

    Köhler, N. Bewertete Bäume. Arch. Math 30, 104–109 (1978). https://doi.org/10.1007/BF01226026

    Download citation

    • Received:

    • Issue Date:

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

    Search

    Navigation