- Circular Choosability2009 | Faculty of Mathematics and Physics
- Minimum non-chromatic-λ-choosable graphs2023 | Central Library of Charles University
- The last excluded case of Dirac's Map-Color Theorem for choosability2006 | Faculty of Mathematics and Physics
- Bad list assignments for non-k-choosable k-chromatic graphs with 2k+2-vertices2023 | Central Library of Charles University
- Choosability of Graphs with Infinite Sets of Forbidden Differences2007 | Faculty of Mathematics and Physics
- Akbari, Saieed; Mirrokni, Vahab S.; Sadjad, Bashir S.: A relation between choosability and uniquely list colorability2007 | Faculty of Mathematics and Physics
- New trends in graph coloring. Choosability and list colorings1999 | Publication without faculty affiliation
- Brooks-type theorems for choosability with separation1998 | Faculty of Mathematics and Physics
- Brooks type theorems for choosability with separationPublication without faculty affiliation
- New trends in the theory of graph colorings:Choosability and list coloring1999 | Faculty of Mathematics and Physics
- On generalized choice and coloring numbers2019 | Faculty of Mathematics and Physics
- List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs2016 | Faculty of Mathematics and Physics
- Flexibility of planar graphs-Sharpening the tools to get lists of size four2022 | Faculty of Mathematics and Physics
- Single-conflict colouring2021 | Faculty of Mathematics and Physics
- Flexibility of planar graphs without 4-cycles2019 | Faculty of Mathematics and Physics
- 3-choosability of triangle-free planar graphs with constraints on 4-cycles2010 | Faculty of Mathematics and Physics
- Graphs with two crossings are 5-choosable2011 | Faculty of Mathematics and Physics
- 3-choosability of planar graphs with ({= 4)-cycles far apart2014 | Faculty of Mathematics and Physics
- List-Coloring Squares of Sparse Subcubic Graphs2008 | Faculty of Mathematics and Physics
