Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, May 10, 2005, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: János Barát (TU Lyngby)
Any point set A of the plane defines a simple graph on its elements as follows: let P and Q be adjacent if and only if the slope of their connecting line belongs to a prescribed set S. A graph G is called k-slope if there exist a proper A and a slope set S of size k. The slope parameter sl(G) is the minimum such k.
We study sl(G) and its connection to other graph parameters such as the chromatic index.
Automatic MiSe System Software Version 1.4803M | admin login