Listcolourings of nearouterplanar graphsTools Hetherington, Timothy J. (2007) Listcolourings of nearouterplanar graphs. PhD thesis, University of Nottingham.
AbstractA listcolouring 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 these different types of listcolouring, each for the class of a nearouterplanar graphs. Since a graph is outerplanar if it is both K4minorfree and K2,3minorfree, then by a nearouterplanar graph we mean a graph that is either K4minorfree or K2,3minorfree.
Actions (Archive Staff Only)
