Publications
- 3-choosability of triangle-free planar graphs with constraints on 4-cycles2010 | Faculty of Mathematics and Physics
- 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
- Irreversible 2-conversion set in graphs of bounded degree2017 | Faculty of Mathematics and Physics
- 4-CRITICAL GRAPHS ON SURFACES WITHOUT CONTRACTIBLE ({= 4)-CYCLES2014 | Faculty of Mathematics and Physics
- Upper bounds on the size of 4-and 6-cycle-free subgraphs of the hypercube2014 | Faculty of Mathematics and Physics
- The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree +12013 | Faculty of Mathematics and Physics
- Bipartizing fullerenes2012 | Faculty of Mathematics and Physics
- Finding vertex-surjective graph homomorphisms2012 | Faculty of Mathematics and Physics
- Packing chromatic number of distance graphs2012 | Faculty of Mathematics and Physics
Loading network view...