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: | |
|---|---|
| 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 |