Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, November 11, 2008, 12:15 pm
Duration: This information is not available in the database
Location: CAB G51
Speaker: Tom Rackham (Mathematical Institute, Oxford Univ.)
Let G be a simple k-colourable graph and let P be a subset of V(G) of which all vertices are pairwise far apart. Under what circumstances does any k-colouring of P extend to a proper k- colouring of G? Given a family of k-colourable graphs, how much freedom is there in assigning a k-colouring? We present several methods for obtaining distance-constraint precolouring results in the context of using at most .(G) colours. We will discuss the question of the flexibility of list-colourings and improper- colourings of planar graphs.
Automatic MiSe System Software Version 1.4803M | admin login