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

dc.contributor.author	Fronček, Dalibor
dc.contributor.author	Kovář, Petr
dc.contributor.author	Kubesa, Michael
dc.date.accessioned	2011-09-02T11:36:24Z
dc.date.available	2011-09-02T11:36:24Z
dc.date.issued	2011
dc.description.abstract	We give a complete characterization of trees with at most four non-leave vertices, which factorize the complete graph K 2n .	cs
dc.identifier.citation	Graphs and Combinatorics. 2011, vol. 27, no. 5, p. 621-646.	cs
dc.identifier.doi	10.1007/s00373-010-0991-0
dc.identifier.issn	0911-0119
dc.identifier.issn	1435-5914
dc.identifier.location	Není ve fondu ÚK	cs
dc.identifier.uri	http://hdl.handle.net/10084/89112
dc.identifier.wos	000293791300001
dc.language.iso	en	cs
dc.publisher	Springer	cs
dc.relation.ispartofseries	Graphs and Combinatorics	cs
dc.relation.uri	https://doi.org/10.1007/s00373-010-0991-0	cs
dc.subject	graph factorization	cs
dc.subject	spanning trees	cs
dc.subject	graph labeling	cs
dc.title	Factorizations of complete graphs into trees with at most four non-leave vertices	cs
dc.type	article	cs

Files

Now showing 1 - 1 out of 1 results