Author: Maheo M. Sacle J.F. Wozniak M.
Publisher: Academic Press
ISSN: 0195-6698
Source: European Journal of Combinatorics, Vol.17, Iss.6, 1996-08, pp. : 543-563
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
We present complete results concerning edge-disjoint placement of three trees of order n into the complete graph k n .
Related content
A Property on Edge-disjoint Spanning Trees
European Journal of Combinatorics, Vol. 17, Iss. 5, 1996-07 ,pp. :
Minimum degree and minimum number of edge-disjoint trees
Discrete Mathematics, Vol. 275, Iss. 1, 2004-01 ,pp. :
Edge-disjoint odd cycles in planar graphs
Journal of Combinatorial Theory, Series B, Vol. 90, Iss. 1, 2004-01 ,pp. :
The Journal of Symbolic Logic, Vol. 36, Iss. 1, 1971-03 ,pp. :
Line Transversals to Disjoint Balls
By Borcea Ciprian Goaoc Xavier Petitjean Sylvain
Discrete & Computational Geometry, Vol. 39, Iss. 1-3, 2008-03 ,pp. :