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...
Huvudupphovsman: | Meeks, KFT |
---|---|
Övriga upphovsmän: | Scott, A |
Materialtyp: | Lärdomsprov |
Språk: | English |
Publicerad: |
2012
|
Ämnen: |
Liknande verk
Liknande verk
-
Colourings of random graphs
av: Heckel, A
Publicerad: (2016) -
Cycles in edge-coloured graphs and subgraphs of random graphs
av: White, M
Publicerad: (2011) -
Improper colourings of graphs
av: Kang, R
Publicerad: (2008) -
The complexity of graph polynomials
av: Noble, S, et al.
Publicerad: (1997) -
Connectivity and related properties for graph classes
av: Weller, K, et al.
Publicerad: (2014)