Skip to main content
SpringerLink
Log in

On Cyclic Packing of a Tree

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

We prove that there exists a packing of copies of a tree of size into K n . Moreover, the proof provides an easy algorithm.

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

Similar content being viewed by others

Author information

Authors and Affiliations

  1. TU Ilmenau, Fakultät für Mathematik und Wissenschaften, Weimarer Strasse 25, 98684, Ilmenau, Germany

    Stephan Brandt

  2. Department of Discrete Mathematics, Faculty of Applied Mathematics AGH, Al. Mickiewicza 30, 0-059, Kraków, Poland

    Mariusz Woźniak

Authors
  1. Stephan Brandt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mariusz Woźniak
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mariusz Woźniak.

Additional information

Acknowledgments. The research of the second author was partially supported by Deutscher Akademischer Austauschdienst.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brandt, S., Woźniak, M. On Cyclic Packing of a Tree. Graphs and Combinatorics 20, 435–442 (2004). https://doi.org/10.1007/s00373-004-0583-y

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-004-0583-y

Keywords

Search

Navigation