Graph colourings and games
<p>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.</p><p>Much of the thesis is concerned with the computation...
Main Author: | Meeks, KFT |
---|---|
Other Authors: | Scott, A |
Format: | Thesis |
Language: | English |
Published: |
2012
|
Subjects: |
Similar Items
-
Colourings of random graphs
by: Heckel, A
Published: (2016) -
Cycles in edge-coloured graphs and subgraphs of random graphs
by: White, M
Published: (2011) -
Improper colourings of graphs
by: Kang, R
Published: (2008) -
The complexity of graph polynomials
by: Noble, S, et al.
Published: (1997) -
Connectivity and related properties for graph classes
by: Weller, K, et al.
Published: (2014)