Mixing graph colourings
This thesis investigates some problems related to graph colouring, or. more precisely. graph re-colouring. Informally, the basic question addressed can be phrased as follows. Suppose one is given a graph G whose vertices can be properly k-coloured. for some k > 2. Is it possible to transform any...
Main Author: | Cereceda, Luis |
---|---|
Published: |
London School of Economics and Political Science (University of London)
2007
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.498127 |
Similar Items
-
Learning and predicting with chain event graphs
by: Freeman, Guy
Published: (2010) -
Algebraic graph theory in the analysis of frequency assignment problems
by: Pejić, Snežana
Published: (2008) -
The dynamic chain event graph
by: Collazo, Rodrigo A.
Published: (2017) -
Chain event graphs : theory and application
by: Thwaites, Peter
Published: (2008) -
Inference for generalised linear mixed models with sparse structure
by: Ogden, Helen E.
Published: (2014)