Graph colouring with input restrictions
In this thesis, we research the computational complexity of the graph colouring problem and its variants including precolouring extension and list colouring for graph classes that can be characterised by forbidding one or more induced subgraphs. We investigate the structural properties of such graph...
Main Author: | Song, Jian |
---|---|
Published: |
Durham University
2013
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.571922 |
Similar Items
-
Topics in graph colouring and extremal graph theory
by: Feghali, Carl
Published: (2016) -
Aspects of graph colouring
by: Williams, Jini
Published: (2004) -
Coloured graph models : associating emitters and ships
by: Hillebrand, Anne
Published: (2015) -
Overlap and fractional graph colouring
by: Watts, Ivor Llewellyn
Published: (2009) -
Topics in graph colouring and graph structures
by: Ferguson, David G.
Published: (2013)