Show simple item record

dc.contributor.authorKubesa, Michael
dc.date.accessioned2006-10-13T08:43:14Z
dc.date.available2006-10-13T08:43:14Z
dc.date.issued2005
dc.identifier.citationUtilitas Mathematica. 2005, vol. 68, p. 79-86.en
dc.identifier.issn0315-3681
dc.identifier.urihttp://hdl.handle.net/10084/57095
dc.description.abstractWe examine constructions of non-symmetric trees with an alike labeling, which allow factorization of K-2n into spanning trees, arising from graceful trees.en
dc.language.isoenen
dc.publisherUtilitas Mathematicaen
dc.relation.ispartofseriesUtilitas Mathematicaen
dc.subjectgraph decomposition and factorizationen
dc.subjectgraph labelingen
dc.subjectgraceful labelingen
dc.subjectalpha-like labelingen
dc.titleGraceful trees and factorizations of complete graphs into non-symmetric isomorphic treesen
dc.typearticleen
dc.identifier.locationNení ve fondu ÚKen
dc.identifier.wos000234383000007


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record