Tam çizgelerin çözünebilir döngü sistemleri

Cycle decomposition of a graph G is a collection of edge-disjoint cycles G_1, G_2,...., G_r of G such that each edge of G belongs to exactly one of those cycles. If the cycles can be partitioned into classes in such a way that the cycles in a given class are vertex disjoint, and their union is a spanning subgraph of G, then this decomposition is called resolvable cycle decomposition of G. Each class in a resolvable cycle decomposition is called a parallel class of that decomposition. If all the cycles have the same length in a decomposition, then the decomposition is called a uniform cycle decomposition. This thesis is a survey on uniform resolvable cycle decompositions of complete graphs.