| Directed path-width and monotonicity in digraph searching J Barát Graphs and Combinatorics 22 (2), 161-172, 2006 | 129 | 2006 |
| Claw‐decompositions and tutte‐orientations J Barát, C Thomassen Journal of Graph Theory 52 (2), 135-146, 2006 | 80 | 2006 |
| Bounded-degree graphs have arbitrarily large geometric thickness J Barát, J Matousek, DR Wood arXiv preprint math/0509150, 2005 | 66 | 2005 |
| Partitioning 2-edge-colored graphs by monochromatic paths and cycles J Balogh, J Barát, D Gerbner, A Gyárfás, GN Sárközy Combinatorica 34 (5), 507-526, 2014 | 44 | 2014 |
| On square-free vertex colorings of graphs J Barát, P Varjú Studia Scientiarum Mathematicarum Hungarica 44 (3), 411-422, 2007 | 40 | 2007 |
| Notes on nonrepetitive graph colouring J Barát, DR Wood arXiv preprint math/0509608, 2005 | 37 | 2005 |
| Edge-decomposition of graphs into copies of a tree with four edges J Barát, D Gerbner arXiv preprint arXiv:1203.1671, 2012 | 31 | 2012 |
| Rainbow matchings in bipartite multigraphs J Barát, A Gyárfás, GN Sárközy Periodica Mathematica Hungarica 74, 108-111, 2017 | 29 | 2017 |
| Disproof of the list Hadwiger conjecture J Barát, G Joret, DR Wood arXiv preprint arXiv:1110.2272, 2011 | 25 | 2011 |
| Multipartite hypergraphs achieving equality in Ryser’s conjecture R Aharoni, J Barát, IM Wanless Graphs and Combinatorics 32 (1), 1-15, 2016 | 22 | 2016 |
| Facial nonrepetitive vertex coloring of plane graphs J Barát, J Czap Journal of Graph Theory 74 (1), 115-121, 2013 | 22 | 2013 |
| Elementary proof techniques for the maximum number of islands J Barát, P Hajnal, EK Horváth European Journal of Combinatorics 32 (2), 276-281, 2011 | 22 | 2011 |
| Towards the Albertson conjecture J Barát, G Tóth arXiv preprint arXiv:0909.0413, 2009 | 21 | 2009 |
| Minimal Blocking Sets in PG(2, 8) and Maximal Partial Spreads in PG(3, 8) J Barát, A Del Fra, S Innamorati, L Storme Designs, Codes and Cryptography 31, 15-26, 2004 | 18 | 2004 |
| A family of extremal hypergraphs for Ryser's conjecture A Abu-Khazneh, J Barát, A Pokrovskiy, T Szabó Journal of Combinatorial Theory, Series A 161, 164-177, 2019 | 15 | 2019 |
| Improvements on the density of maximal 1‐planar graphs J Barát, G Tóth Journal of Graph Theory 88 (1), 101-109, 2018 | 15 | 2018 |
| On the structure of graphs with path-width at most two J Barát, P Hajnal, Y Lin, A Yang Studia Scientiarum Mathematicarum Hungarica 49 (2), 211-222, 2012 | 14 | 2012 |
| The slope parameter of graphs G Ambrus, J Barát, P Hajnal Technical University of Denmark, Department of Mathematics, 2005 | 14 | 2005 |
| Rainbow matchings and transversals J Barát Australasian Journal of Combinatorics 59 (1), 211-217, 2014 | 12 | 2014 |
| On square-free edge colorings of graphs J Barát, PP Varjú Ars Combinatoria 87, 377-383, 2008 | 12 | 2008 |
