This thesis is dedicated to the coloring of cubic graphs. It summarizes the knowledge we have about so called Steiner coloring, which is an edge-coloring such that the colors incident with one vertex form a triple of some partial Steiner system. The main objects of interest are the projective and affine systems. Afterwards the sufficient condition for universality of the system is stated and it is observed, that all other transitive Steiner triple systems satisfy it. This thesis also contains methods of construction of the coloring for the Fano plane, for the affine system Z3 3 and for the universal system created as a product of the Fano plane and the trivial system (F7 S⊠ 3). Finally an algorithm usable for the rest of the systems and graphs with bounded treewidth is presented.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:368125 |
| Date | January 2017 |
| Creators | Tlustá, Stanislava |
| Contributors | Fiala, Jiří, Šámal, Robert |
| Source Sets | Czech ETDs |
| Language | Czech |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0018 seconds