The aim of this thesis is to bring together two areas of the graph theory. We first give a brief exposition of graph homomorphisms and related notions that directs to the definition of the replacement operation by using an appropriate replacement graph. The tree-depth is investigated as one of considerable chara- cteristics of each graph. Finally we focus on category representations in the category Graph of all finite graphs and Graphk of all finite graphs with tree-depth at most k.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:305058 |
| Date | January 2012 |
| Creators | Scholleová, Barbora |
| Contributors | Nešetřil, Jaroslav, Loebl, Martin |
| Source Sets | Czech ETDs |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0017 seconds