| dc.contributor.author | Fronček, Dalibor | |
| dc.date.accessioned | 2007-09-17T12:26:44Z | |
| dc.date.available | 2007-09-17T12:26:44Z | |
| dc.date.issued | 2007 | |
| dc.identifier.citation | Discrete Mathematics. 2007, vol. 307, issues 11-12, p. 1317-1322. | en |
| dc.identifier.issn | 0012-365X | |
| dc.identifier.uri | http://hdl.handle.net/10084/62778 | |
| dc.description | Issues 11-12 (2007): The Fourth Caracow Conference on Graph Theory, Czorsztyn, Poland, 2002. | en |
| dc.language.iso | en | en |
| dc.publisher | North-Holland | en |
| dc.relation.ispartofseries | Discrete Mathematics | en |
| dc.relation.uri | https://doi.org/10.1016/j.disc.2003.11.061 | en |
| dc.subject | graph factorization | en |
| dc.subject | graph labelling | en |
| dc.subject | spanning trees | en |
| dc.title | Bi-cyclic decompositions of complete graphs into spanning trees | en |
| dc.type | article | en |
| dc.identifier.location | Není ve fondu ÚK | en |
| dc.description.abstract-en | We examine decompositions of complete graphs K4k+2 into 2k+1 isomorphic spanning trees. We develop a method of factorization based on a new type of vertex labelling, namely blended ρ-labelling. We also show that for every k1 and every k >= 1 and every d, 3 <= d <= 4k + 1 there is a tree with diameter d that decomposes K4k+2 into 2k+1 factors isomorphic to T. | en |
| dc.identifier.doi | 10.1016/j.disc.2003.11.061 | |
| dc.identifier.wos | 000245784100012 | |