Factorizations of complete graphs into spanning trees with all possible maximum degrees

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F09%3A00021384" target="_blank" >RIV/61989100:27240/09:00021384 - 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 with all possible maximum degrees

Original language description

Fronček and Kovářová provided spanning trees of order 2n that factorize K_{2n} for every n>=2 and for every feasible diameter d, 3<=d<=2n-1. We extend they work and give a spanning tree on 2n vertices with a maximum degree Delta that factorize K_{2n} forevery n>=2 and for every feasible 2<=Delta<=n. We give a construction for both symmetric and non-symmetric spanning trees.

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

2009

Confidentiality

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

Name of the periodical

Lecture Notes in Computer Science-Computational Science

ISSN

0302-9743

e-ISSN

—

Volume of the periodical

5874

Issue of the periodical within the volume

5874

Country of publishing house

DE - GERMANY

Number of pages

11

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—