36 citations · 51 across the 9 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2017
Orientations of 1-Factorizations and the List Chromatic Index of Small Graphs
Uwe Schauz
As starting point, we formulate a corollary to the Quantitative Combinatorial Nullstellensatz. This corollary does not require the consideration of any coefficients of polynomials,…
math.CO2015★ 6 cited
The Tournament Scheduling Problem with Absences
Uwe Schauz
We study time scheduling problems with allowed absences as a new kind of graph coloring problem. One may think of a sport tournament where each player (each team) is permitted a ce…
math.CO2009★ 36 cited
Algebraic proof of Brooks' theorem
Jan Hladký, Daniel Král', Uwe Schauz
We give a proof of Brooks' theorem and its list coloring extension using the algebraic method of Alon and Tarsi; this also shows that the Brooks' theorem remains valid in a more ge…