@misc {IOPORT.04087704,
    author       = {Dean, Nathaniel},
    title        = {How do you decompose a graph into trees of small diameter?},
    howpublished = {Numerical mathematics and computing, 17th Manitoba Conf., Winnipeg Can. 1987, Congr. Numerantium 62, 6-67 (1988).},
    year         = {1988},
    abstract     = {[For the entire collection see Zbl 0656.00028.] It is shown how to decompose an arbitrary graph G into double stars (trees of diameter at most three) and stars (trees of diameter at most two) where the allowed types and numbers of trees used in the decomposition depend on the minimum degree of G and the size of a given maximal matching in G. This method generalizes a theorem (formerly a conjecture by A. Kotzig) on $(2k+1)$-regular graphs with a perfect matching.},
    identifier   = {04087704},
}