Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, November 11, 2008, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Tom Rackham (Mathematical Institute, Oxford Univ.)

Methods of distance-constraint precolouring

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login