| Homepage |
| Curriculum vitae |
| Publications |
| Teaching (czech) |
| Contact |
Decompositions and factorizations of complete graphs
An overview of known methods based on graph labelings that used for decompositions and factorizations of complete graphs.
Abstract
Graph decompositions into isomorphic copies of a given graph is a well established topic studied in both graph theory and design theory. Though spanning tree factorizations may seem to be just a special case of this concept, not many general results are known. We investigate necessary and sufficient conditions for a graph factorization into isomorphic spanning trees to exists.
Status
Submitted for publication in Advances in Computational and System Biology.
P. Kováø, Decompositions and factorizations of complete graphs, Ed. M. Dehmer, submitted (Birkhäuser).
 |
Petr<dot>Kovar<at>vsb<dot>cz phone ++420 / 597 325 972 |
Last update: 29.12.2011 |