| Deciding first-order properties for sparse graphs Z Dvořák, D Král, R Thomas 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 133-142, 2010 | 113 | 2010 |
| Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 Z Dvořák, L Postle Journal of Combinatorial Theory, Series B 129, 38-54, 2018 | 105 | 2018 |
| Testing first-order properties for subclasses of sparse graphs Z Dvořák, D Král, R Thomas Journal of the ACM (JACM) 60 (5), 1-24, 2013 | 93 | 2013 |
| Coloring squares of planar graphs with girth six Z Dvořák, P Nejedlý, R Škrekovski European Journal of Combinatorics 29 (4), 838-849, 2008 | 91 | 2008 |
| Constant-factor approximation of the domination number in sparse graphs Z Dvořák European Journal of Combinatorics 34 (5), 833-840, 2013 | 63 | 2013 |
| A minimum degree condition forcing complete graph immersion M DeVos, Z Dvořák, J Fox, J McDonald, B Mohar, D Scheide Combinatorica 34 (3), 279-298, 2014 | 53 | 2014 |
| Three-coloring triangle-free planar graphs in linear time Z Dvořák, K Kawarabayashi, R Thomas ACM Transactions on Algorithms (TALG) 7 (4), 1-14, 2011 | 53 | 2011 |
| Asymptotical structure of combinatorial objects Z Dvořák Univerzita Karlova, Matematicko-fyzikální fakulta, 2007 | 47 | 2007 |
| Strongly sublinear separators and polynomial expansion Z Dvorák, S Norin SIAM Journal on Discrete Mathematics 30 (2), 1095-1101, 2016 | 42 | 2016 |
| Star chromatic index Z Dvořák, B Mohar, R Šámal Journal of Graph Theory 72 (3), 313-326, 2013 | 40 | 2013 |
| Coloring triangle-free graphs on surfaces Z Dvořák, D Král', R Thomas Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete …, 2009 | 40 | 2009 |
| List-coloring squares of sparse subcubic graphs Z Dvořák, R Škrekovski, M Tancer SIAM Journal on Discrete Mathematics 22 (1), 139-159, 2008 | 37 | 2008 |
| Randić index and the diameter of a graph Z Dvořák, B Lidický, R Škrekovski European Journal of Combinatorics 32 (3), 434-442, 2011 | 35 | 2011 |
| Forbidden graphs for tree-depth Z Dvořák, AC Giannopoulou, DM Thilikos European Journal of Combinatorics 33 (5), 969-979, 2012 | 33 | 2012 |
| On forbidden subdivision characterizations of graph classes Z Dvořák European Journal of Combinatorics 29 (5), 1321-1332, 2008 | 32 | 2008 |
| Classes of graphs with small rank decompositions are χ-bounded Z Dvořák European Journal of Combinatorics 33 (4), 679-683, 2012 | 29 | 2012 |
| A stronger structure theorem for excluded topological minors Z Dvorák arXiv preprint arXiv:1209.0129, 2012 | 24 | 2012 |
| Spectral radius of finite and infinite planar graphs and of graphs of bounded genus Z Dvořák, B Mohar Journal of Combinatorial Theory, Series B 100 (6), 729-739, 2010 | 22 | 2010 |
| Choosability of planar graphs of girth 5 Z Dvorák, K Kawarabayashi arXiv preprint arXiv:1109.2976, 2011 | 21 | 2011 |
| On recognizing graphs by numbers of homomorphisms Z Dvořák Journal of Graph Theory 64 (4), 330-342, 2010 | 21 | 2010 |
