Factorizations of Complete Graphs into Spanning trees

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F03%3A00009191" target="_blank" >RIV/61989100:27240/03:00009191 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Factorizations of Complete Graphs into Spanning trees

Original language description

We examine decompositions of complete graphs K2n into n isomorphic spanning trees. For n even, we develop a method of factorization based on a new type of vertex labeling, namely switching blended labeling. We also present a recursive construction of aninfinite class of spanning trees that factorize K2n for n odd.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2003

Confidentiality

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

Name of the periodical

Congressus Numerancium

ISSN

0302-9743

e-ISSN

—

Volume of the periodical

Neuveden

Issue of the periodical within the volume

154

Country of publishing house

DE - GERMANY

Number of pages

15

Pages from-to

125-134

UT code for WoS article

—

EID of the result in the Scopus database

—