Decompositions and Factorizations of Complete Graphs
Graph decompositions into isomorphic copies of a given graph are a well-established topic studied in both graph theory and design theory. Although 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 exist.
KeywordsGraph decomposition Graph factorization Graph labeling
Unable to display preview. Download preview PDF.
Supported by the Ministry of Education of the Czech Republic Grant No. MSM6198910027. The author wants to thank the anonymous referees, whose comments helped in improving the quality of this chapter.
- 2.Bloom GS (1979) A chronology of the Ringel-Kotzig conjecture and the continuing quest to call all trees graceful. In: Topics in graph theory. The New York Academy of SciencesGoogle Scholar
- 3.Bosák J (1986) Decompositions of graphs. VEDA, BratislavaGoogle Scholar
- 4.Bosák J, Erdös P, Rosa A (1972) Decompositions of complete graphs into factors with diameter two. Mat časopis Slov akad vied 22:14–28Google Scholar
- 5.Bosák J, Rosa A, Znám Š (1968) On decompositions of complete graphs into factors with given diameters. In: Theory of Graphs (Proc Colloq Tihany 1966), Akademiai Kiadó, Budapest, pp 37–56Google Scholar
- 6.Colbourn CJ, Dinitz JH (eds) (2007) The CRC handbook of combinatorial designs, 2nd edn. Discrete mathematics and its applications. CRC press, Boca RatonGoogle Scholar
- 7.Diestel R (2006) Graph theory, 3rd edn. Springer, Berlin HeidelbergGoogle Scholar
- 8.Eldergill P (1997) Decompositions of the complete graph with an even number of vertices. M.Sc. thesis, McMaster University, HamiltonGoogle Scholar
- 15.Fronček D, Kovář P, Kubesa M Factorizations of complete graphs into trees with at most four non-leave vertices, (submitted)Google Scholar
- 17.Gallian JA (2003) A dynamic survey of graph labeling. Electron J Combinator DS6Google Scholar
- 18.Golomb SW (1972) How to number a graph, in graph theory and computing. In: Read RC (ed) Academic, New York, pp 23–37Google Scholar
- 22.Kovářová T (2004) Spanning tree factorizations of complete graphs. Ph.D. thesis, VŠB – Technical University of OstravaGoogle Scholar
- 24.Kubesa M (2004) Factorizations of complete graphs into caterpillars of diameter four and five. Ph.D. thesis, VŠB – Technical University of OstravaGoogle Scholar
- 31.Rosa A (1967) On certain valuations of the vertices of a graph. In: Theory of graphs (Intl Symp Rome 1966), Gordon and Breach, Dunod, Paris, pp 349–355Google Scholar
- 34.Vetrík T (2006) On factorization of complete graphs into isomorphic caterpillars of diameter 6. Magia 22:17–21Google Scholar
- 35.West DB (2001) Introduction to graph theory, 2nd edn. Prentice-Hall, Upper Saddle River, NJGoogle Scholar