Decompositions and factorizations of complete graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F10%3A86075380" target="_blank" >RIV/61989100:27240/10:86075380 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Decompositions and factorizations of complete graphs
Original language description
In this chapter we investigate factorization of complete graphs into isomorphic spanning trees. The main goal is to present a recursive method that generalizes several of previously introduced concepts. We start with a detailed overview of known methods.A brief summary of known results on spanning tree factorization of complete graphs follows. In the last part we describe a construction that unifies most of the presented methods in one general labeling called recursive labeling.
Czech name
—
Czech description
—
Classification
Type
C - Chapter in a specialist book
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Book/collection name
Structural Analysi of Complex Networks
ISBN
978-0-8176-4788-9
Number of pages of the result
28
Pages from-to
—
Number of pages of the book
478
Publisher name
Springer Boston
Place of publication
Boston
UT code for WoS chapter
—