Zobrazit minimální záznam

dc.contributor.authorFronček, Dalibor
dc.contributor.authorKovář, Petr
dc.contributor.authorKovářová, Tereza
dc.contributor.authorKubesa, Michael
dc.date.accessioned2010-01-20T08:15:19Z
dc.date.available2010-01-20T08:15:19Z
dc.date.issued2010
dc.identifier.citationDiscrete Mathematics. 2010, vol. 310, issue 3, p. 537-556.en
dc.identifier.issn0012-365X
dc.identifier.urihttp://hdl.handle.net/10084/77834
dc.description.abstractWe 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.extent1008238 bytescs
dc.format.mimetypeapplication/pdfcs
dc.language.isoenen
dc.publisherElsevieren
dc.relation.ispartofseriesDiscrete Mathematicsen
dc.relation.urihttps://doi.org/10.1016/j.disc.2009.03.040en
dc.subjectgraph factorizationen
dc.subjectspanning treesen
dc.subjectgraph labelingen
dc.titleFactorizations of complete graphs into caterpillars of diameter 5en
dc.typearticleen
dc.identifier.locationNení ve fondu ÚKen
dc.identifier.doi10.1016/j.disc.2009.03.040
dc.rights.accessopenAccess
dc.type.versionsubmittedVersion
dc.identifier.wos000273114200024


Soubory tohoto záznamu

Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam