Title of article
Packing Three Copies of a Tree into a Complete Graph
Author/Authors
Wang، نويسنده , , Hong and Sauer، نويسنده , , Norbert، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1993
Pages
6
From page
137
To page
142
Abstract
A three T of order n is said to be 3-placeable if there are three edge-disjoint copies of T in Kn. In this paper we characterize all the trees T such that T is 3-placeable.
Journal title
European Journal of Combinatorics
Serial Year
1993
Journal title
European Journal of Combinatorics
Record number
1546755
Link To Document