List-colourings of near-outerplanar graphs
A list-colouring of a graph is an assignment of a colour to each vertex v from its own list L(v) of colours. Instead of colouring vertices we may want to colour other elements of a graph such as edges, faces, or any combination of vertices, edges and faces. In this thesis we will study several of th...
| Main Author: | |
|---|---|
| Format: | Thesis (University of Nottingham only) |
| Language: | English |
| Published: |
2007
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/11157/ |