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, March 10, 2009, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Philipp Zumstein

On Polychromatic 3- and 4-Colorings of Plane Graphs

A plane graph is polychromatic k-colorable if there exists a k-coloring of its vertices such that in each face all k colors appear. We will discuss several results implying that a graph is polychromatic 3- or 4-colorable, which have consequences to some variant of the art gallery problem.

A simple bipartite 2-connected plane graph has a polychromatic 3-coloring, which follows from a result by Hoffmann and Kriegel that these graphs admit an even triangulation. Horev and Krakovski have shown that all plane graphs with maximum degree at most 3 are polychromatic 3-colorable with two exceptions. The special graph class of rectangular partitions is polychromatic 4-colorable.

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