Factorizations of complete graphs into trees with at most four non-leave vertices
Loading...
Downloads
0
Date issued
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Location
Není ve fondu ÚK
Signature
Abstract
We give a complete characterization of trees with at most four non-leave vertices, which factorize the complete graph K 2n .
Description
Subject(s)
graph factorization, spanning trees, graph labeling
Citation
Graphs and Combinatorics. 2011, vol. 27, no. 5, p. 621-646.