A homomorphism from a graph G to a graph H is a function from V (G) to V (H) that preserves edges. Many combinatorial structures that arise in mathematics and in computer science can be represented naturally as graph homomorphisms and as weighted sums of graph homomorphisms. In this thesis we study the complexity of various problems related to graph homomorphisms.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:729929 |
| Date | January 2016 |
| Creators | Magkakis, Andreas Gkompel |
| Contributors | Goldberg, Leslie Ann |
| Publisher | University of Oxford |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Source | https://ora.ox.ac.uk/objects/uuid:42be90cd-75b5-43ec-ad2e-5d513420bdc0 |
Page generated in 0.0014 seconds