Back to Search
Thesis icon

Thesis

Graph colourings and games

Abstract:

Graph colourings and combinatorial games are two very widely studied topics in discrete mathematics. This thesis addresses the computational complexity of a range of problems falling within one or both of these subjects.

Much of the thesis is concerned with the computational complexity of problems related to the combinatorial game (Free-)Flood-It, in which players aim to make a coloured graph monochromatic ("flood" the graph) with the minimum possible number of flooding operations; s...

Expand abstract

Actions

  • Cite

  • Print

Access Document

Files:

Authors

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

Contributors

Division:
MPLS
Department:
Mathematical Institute
Role:
Supervisor
Publication date:
2012
Type of award:
DPhil
Level of award:
Doctoral
Awarding institution:
University of Oxford
Language:
English
Keywords:
Subjects:
UUID:
uuid:a805a379-f891-4250-9a7d-df109f9f52e2
Local pid:
ora:7215
Deposit date:
2013-08-22

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