- Planar graphs without 3-,7-, and 8-cycles are 3-choosable2009 | Faculty of Mathematics and Physics
- On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles2009 | Faculty of Mathematics and Physics
- 3-choosability of planar graphs with ({= 4)-cycles far apart2014 | Faculty of Mathematics and Physics
- 3-choosability of triangle-free planar graphs with constraints on 4-cycles2010 | Faculty of Mathematics and Physics
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 82018 | Faculty of Mathematics and Physics