Factorizations of complete graphs into trees with at most four non-leave vertices

DSpace/Manakin Repository

aaK citaci nebo jako odkaz na tento záznam použijte identifikátor: http://hdl.handle.net/10084/89112

Show full item record


Title: Factorizations of complete graphs into trees with at most four non-leave vertices
Author: Fronček, Dalibor
Kovář, Petr
Kubesa, Michael
Date issue: 2011
Citation: Graphs and combinatorics. 2011, vol. 27, no. 5, p. 621-646.
URI: http://hdl.handle.net/10084/89112
ISSN: 0911-0119
1435-5914
DOI: 10.1007/s00373-010-0991-0
URI: http://dx.doi.org/10.1007/s00373-010-0991-0
Type: article
Access rights: Fulltext Request
Počet citací dokumentu:

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show full item record

Search DSpace


Advanced Search

Navigation

Browse

My Account

Statistics