Regular Coverings - Structure and Complexity Michaela Seifrtová The thesis consists of two main parts, the first concentrated on the struc- ture of graph coverings, where different properties of regular graph coverings are presented, and the second dealing with computational complexity of the covering problem. Favorable results have been achieved in this area, proving the problem is solvable in polynomial time for all graphs whose order is a prime multiple of the order of the covered graph. 1
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:308190 |
| Date | January 2012 |
| Creators | Seifrtová, Michaela |
| Contributors | Fiala, Jiří, Nedela, Roman |
| 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.0016 seconds