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...
Autor Principal: | Meeks, KFT |
---|---|
Outros autores: | Scott, A |
Formato: | Thesis |
Idioma: | English |
Publicado: |
2012
|
Subjects: |
Títulos similares
-
Colourings of random graphs
por: Heckel, A
Publicado: (2016) -
Cycles in edge-coloured graphs and subgraphs of random graphs
por: White, M
Publicado: (2011) -
Improper colourings of graphs
por: Kang, R
Publicado: (2008) -
The complexity of graph polynomials
por: Noble, S, et al.
Publicado: (1997) -
Connectivity and related properties for graph classes
por: Weller, K, et al.
Publicado: (2014)