Spanning tree factorizations of complete graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F04%3A00010917" target="_blank" >RIV/61989100:27240/04:00010917 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Spanning tree factorizations of complete graphs
Original language description
We examine decompositions of complete graphs with an even number of vertices into isomorphic spanning trees. We develop a cyclic factorization of $K_{2n}$ into non-symmetric spanning trees. Our factorization method are based on flexible $q$-labeling andblended labeling, introduced by Froncek. In this paper we presente several infinite classes of non-symmetric trees which have flexible $q$-labeling or blended labeling.
Czech name
Spanning tree factorizations of complete graphs
Czech description
We examine decompositions of complete graphs with an even number of vertices into isomorphic spanning trees. We develop a cyclic factorization of $K_{2n}$ into non-symmetric spanning trees. Our factorization method are based on flexible $q$-labeling andblended labeling, introduced by Froncek. In this paper we presente several infinite classes of non-symmetric trees which have flexible $q$-labeling or blended labeling.

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Publication year
2004
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical
Journal of Combinatorial Mathematics and Combinatorial Computing
ISSN
0835-3026
e-ISSN
—
Volume of the periodical
Neuveden
Issue of the periodical within the volume
52
Country of publishing house
CA - CANADA
Number of pages
17
Pages from-to
33-49
UT code for WoS article
—
EID of the result in the Scopus database
—

Similar results(10)