Volume 1, Issue 2 (November 2006)
IJMSI 2006, 1(2): 65-77 |
Back to browse issues page
Abstract:
A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.
Type of Study: Research paper |
Subject:
General
| Rights and permissions | |
 |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |