Factorizations of complete graphs into caterpillars of diameter 5

dc.contributor.author	Fronček, Dalibor
dc.contributor.author	Kovář, Petr
dc.contributor.author	Kovářová, Tereza
dc.contributor.author	Kubesa, Michael
dc.date.accessioned	2010-01-20T08:15:19Z
dc.date.available	2010-01-20T08:15:19Z
dc.date.issued	2010
dc.description.abstract	We examine factorizations of complete graphs K2n into caterpillars of diameter 5. First we present a construction generalizing some previously known methods. Then we use the new method along with some previous partial results to give a complete characterization of caterpillars of diameter 5, which factorize the complete graph K2n.	en
dc.format.extent	1008238 bytes	cs
dc.format.mimetype	application/pdf	cs
dc.identifier.citation	Discrete Mathematics. 2010, vol. 310, issue 3, p. 537-556.	en
dc.identifier.doi	10.1016/j.disc.2009.03.040
dc.identifier.issn	0012-365X
dc.identifier.location	Není ve fondu ÚK	en
dc.identifier.uri	http://hdl.handle.net/10084/77834
dc.identifier.wos	000273114200024
dc.language.iso	en	en
dc.publisher	Elsevier	en
dc.relation.ispartofseries	Discrete Mathematics	en
dc.relation.uri	https://doi.org/10.1016/j.disc.2009.03.040	en
dc.rights.access	openAccess
dc.subject	graph factorization	en
dc.subject	spanning trees	en
dc.subject	graph labeling	en
dc.title	Factorizations of complete graphs into caterpillars of diameter 5	en
dc.type	article	en
dc.type.version	submittedVersion

Files

Now showing 1 - 1 out of 1 results