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...
1. autor: | Meeks, KFT |
---|---|
Kolejni autorzy: | Scott, A |
Format: | Praca dyplomowa |
Język: | English |
Wydane: |
2012
|
Hasła przedmiotowe: |
Podobne zapisy
-
Improper colourings of graphs
od: Kang, R
Wydane: (2008) -
Colourings of random graphs
od: Heckel, A
Wydane: (2016) -
Extremal properties of flood-filling games
od: Kitty Meeks, i wsp.
Wydane: (2019-07-01) -
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
od: Laurent Beaudou, i wsp.
Wydane: (2024-04-01) -
Defective Coloring on Classes of Perfect Graphs
od: Rémy Belmonte, i wsp.
Wydane: (2022-01-01)