| Homepage |
| Curriculum vitae |
| Publications |
| Teaching (czech) |
| Contact |
Factorizations of complete graphs into spanning trees with all possible maximum degrees
A construction of a spanning tree for every feasible maximum degree that factorize the complete graph K2n.
Abstract
Fronček and Kovářová provided spanning trees of order 2n that factorize K2n for every n≥2 and for every feasible diameter d, 3≤d≤2n-1. We extend they work and give a spanning tree on 2n vertices with a maximum degree Δ that factorize K2n for every n≥2 and for every feasible 2≤Δ≤n. We give a construction for both symmetric and non-symmetric spanning trees.
Status
Submitted to IWOCA.
 |
Petr<dot>Kovar<at>vsb<dot>cz phone ++420 / 597 325 972 |
Last update: 29.12.2011 |