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


Authors


More by this author
Institution:
University of Oxford
Oxford college:
Merton College
Department:
Mathematical,Physical & Life Sciences Division - Mathematical Institute

Contributors

Role:
Supervisor
Publication date:
2012
Type of award:
DPhil
Level of award:
Doctoral
Awarding institution:
Oxford University, UK
URN:
uuid:a805a379-f891-4250-9a7d-df109f9f52e2
Local pid:
ora:7215

Terms of use


Metrics



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

TO TOP