| Homepage |
| Curriculum vitae |
| Publications |
| Teaching (czech) |
| Contact |
Factorizations of complete graphs into trees with at most four non-leave vertices
A complete clasification of lobsters (and trees) of diameter 4 with at most four non-leave vertices whether they factorize a complete graph.
Abstract
We give a complete characterization of trees with at most four non-leave vertices, which factorize the complete graph K2n.
Status
Submitted for publication to Graphs and Combinatorics.
D. Fronček, P. Kovář, and M. Kubesa: Factorizations of complete graphs into trees with at most four non-leave vertices, submitted (Graphs and Combinatorics).
 |
Petr<dot>Kovar<at>vsb<dot>cz phone ++420 / 597 325 972 |
Last update: 29.12.2011 |