Graceful trees and factorizations of complete graphs into non-symmetric isomorphic trees

dc.contributor.author	Kubesa, Michael
dc.date.accessioned	2006-10-13T08:43:14Z
dc.date.available	2006-10-13T08:43:14Z
dc.date.issued	2005
dc.description.abstract	We 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.identifier.citation	Utilitas Mathematica. 2005, vol. 68, p. 79-86.	en
dc.identifier.issn	0315-3681
dc.identifier.location	Není ve fondu ÚK	en
dc.identifier.uri	http://hdl.handle.net/10084/57095
dc.identifier.wos	000234383000007
dc.language.iso	en	en
dc.publisher	Utilitas Mathematica	en
dc.relation.ispartofseries	Utilitas Mathematica	en
dc.subject	graph decomposition and factorization	en
dc.subject	graph labeling	en
dc.subject	graceful labeling	en
dc.subject	alpha-like labeling	en
dc.title	Graceful trees and factorizations of complete graphs into non-symmetric isomorphic trees	en
dc.type	article	en

Collections