1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.CO2023
Schnyder woods and Alon-Tarsi number of planar graphs
Jakub Kozik, Bartosz Podkanowicz
Thomassen in 1994 published a famous proof of the fact that the choosability of a planar graph is at most 5. Zhu in 2019 generalized this result by showing that the same bound hold…
math.CO2014★ 1 cited
Improved algorithms for colorings of simple hypergraphs and applications
Jakub Kozik, Dmitry Shabanov
The paper deals with extremal problems concerning colorings of hypergraphs. By using a random recoloring algorithm we show that any -uniform simple (i.e. every two distinct edge…