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 em: |
2012
|
Assuntos: |
Registos relacionados
-
Colourings of random graphs
Por: Heckel, A
Publicado em: (2016) -
Cycles in edge-coloured graphs and subgraphs of random graphs
Por: White, M
Publicado em: (2011) -
Improper colourings of graphs
Por: Kang, R
Publicado em: (2008) -
The complexity of graph polynomials
Por: Noble, S, et al.
Publicado em: (1997) -
Connectivity and related properties for graph classes
Por: Weller, K, et al.
Publicado em: (2014)