Showing math.COShow all
2 papers · 1 filter
math.CO2021
Precoloring Extension. IV. General Bounds and List Colorings
Mihály Hujter, Zsolt Tuza
A guaranteed upper bound is proved for the time complexity of the list-coloring problem on graphs.
math.CO2016
Symmetries related to domino tilings on a chessboard
M. Hujter, A. Kaszanyitzky
In this paper we study different kinds of symmetries related to the domino tilings of chessboards.