Thesis icon

Thesis

Graph colouring and other stories

Abstract:

This thesis investigates a variety of different problems within the field of Graph Theory. Half of these problems relate to edge-colourings of graphs; the other half are concerned with H-colourings, reconstruction, and pursuit and evasion games.
For graphs G and H, an H-colouring of G is a map ψ : V (G) → V (H) such that ij ∈ E(G) ⇒ ψ(i)ψ(j) ∈ E(H). The number of H-colourings of G is denoted by hom(G, H). In Chapter 2, we prove the following: for all graphs H and δ ≥ 3, there is a c...

Expand abstract

Actions


Access Document


Files:
  • (Dissemination version, 548.9KB)

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Research group:
Combinatorics
Oxford college:
Merton College
Role:
Author

Contributors

Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Research group:
Combinatorics
Oxford college:
Merton College
Role:
Supervisor
More from this funder
Name:
Engineering and Physical Sciences Research Council
Funder identifier:
http://dx.doi.org/10.13039/501100000266
Funding agency for:
Guggiari, H
Type of award:
DPhil
Level of award:
Doctoral
Awarding institution:
University of Oxford
Language:
English
Keywords:
Subjects:
Deposit date:
2020-08-30

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP