Title of article
Multicolored Trees in Complete Graphs
Author/Authors
Brualdi، نويسنده , , Richard A. and Hollingsworth، نويسنده , , Susan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
4
From page
310
To page
313
Abstract
We prove the existence of two edge-disjoint multicolored spanning trees in any edge-coloring of a complete graph by perfect matchings; we conjecture that a full partition into multicolored spanning trees is always possible.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1996
Journal title
Journal of Combinatorial Theory Series B
Record number
1526191
Link To Document