scholarly journals Edge-disjoint rainbow spanning trees in complete graphs

2016 ◽  
Vol 57 ◽  
pp. 71-84 ◽  
Author(s):  
James M. Carraher ◽  
Stephen G. Hartke ◽  
Paul Horn
2002 ◽  
Vol Vol. 5 ◽  
Author(s):  
Gregory Constantine

International audience Can a complete graph on an even number n (>4) of vertices be properly edge-colored with n-1 colors in such a way that the edges can be partitioned into edge disjoint colorful isomorphic spanning trees? A spanning treee is colorful if all n-1 colors occur among its edges. It is proved that this is possible to accomplish whenever n is a power of two, or five times a power of two.


2009 ◽  
Vol 410 (8-10) ◽  
pp. 926-932 ◽  
Author(s):  
Sun-Yuan Hsieh ◽  
Chang-Jen Tu

2020 ◽  
Vol 34 (4) ◽  
pp. 2346-2362
Author(s):  
Linyuan Lu ◽  
Zhiyu Wang

2017 ◽  
Vol 88 (4) ◽  
pp. 577-591 ◽  
Author(s):  
Miaomiao Han ◽  
Hong-Jian Lai ◽  
Jiaao Li
Keyword(s):  

2020 ◽  
Author(s):  
Jørgen Bang‐Jensen ◽  
Stéphane Bessy ◽  
Jing Huang ◽  
Matthias Kriesell
Keyword(s):  

2015 ◽  
Vol 81 (1) ◽  
pp. 16-29 ◽  
Author(s):  
Xiaofeng Gu ◽  
Hong-Jian Lai ◽  
Ping Li ◽  
Senmei Yao

2021 ◽  
Author(s):  
◽  
Minjin Enkhjargal

Sign in / Sign up

Export Citation Format

Share Document