Decompositions and factorizations of complete graphs

Kód výsledku v 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>
Výsledek na webu
—
DOI - Digital Object Identifier
—

Jazyk výsledku
angličtina
Název v původním jazyce
Decompositions and factorizations of complete graphs
Popis výsledku v původním jazyce
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.
Název v anglickém jazyce
Decompositions and factorizations of complete graphs
Popis výsledku anglicky
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.

Rok uplatnění
2010
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)