4-PLACEMENT OF ROOTED TREES

Author(s):

H. Yousefi , Azari , A. Goodarzi

Message:
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.
Language:
English
Published:
Iranian Journal of Mathematical Sciences and Informatics, Volume:1 Issue: 2, Nov 2006
Pages:
65 to 77
https://www.magiran.com/p622632