| Graphs and homomorphisms P Hell, J Nesetril Oxford University Press, 2004 | 1159 | 2004 |
| On the complexity of H-coloring P Hell, J Nešetřil Journal of Combinatorial Theory, Series B 48 (1), 92-110, 1990 | 874 | 1990 |
| Otakar Borůvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history J Nešetřil, E Milková, H Nešetřilová Discrete mathematics 233 (1-3), 3-36, 2001 | 398 | 2001 |
| Sparsity: graphs, structures, and algorithms J Nešetřil, PO De Mendez Springer Science & Business Media, 2012 | 360 | 2012 |
| Invitation to discrete mathematics J Ne Oxford University Press, 2009 | 292 | 2009 |
| Grad and classes with bounded expansion I. Decompositions J Nešetřil, PO De Mendez European Journal of Combinatorics 29 (3), 760-776, 2008 | 264* | 2008 |
| On the complexity of the subgraph problem J Nešetřil, S Poljak Commentationes Mathematicae Universitatis Carolinae 26 (2), 415-419, 1985 | 248 | 1985 |
| The core of a graph P Hell, J Nešetřil Discrete Mathematics 109 (1-3), 117-126, 1992 | 244 | 1992 |
| Tree-depth, subgraph coloring and homomorphism bounds J Nešetřil, PO De Mendez European Journal of Combinatorics 27 (6), 1022-1041, 2006 | 223 | 2006 |
| Partitions of finite relational and set systems J Nešetřil, V Rödl Journal of Combinatorial Theory, Series A 22 (3), 289-312, 1977 | 205 | 1977 |
| The Ramsey property for graphs with forbidden complete subgraphs J Nešetřil, V Rödl Journal of Combinatorial Theory, Series B 20 (3), 243-249, 1976 | 166 | 1976 |
| Ramsey theory J Nešetřil Handbook of combinatorics (vol. 2), 1331-1403, 1996 | 161 | 1996 |
| Duality theorems for finite structures (characterising gaps and good characterisations) J Nešetřil, C Tardif Journal of Combinatorial Theory, Series B 80 (1), 80-97, 2000 | 150 | 2000 |
| On classes of relations and graphs determined by subobjects and factorobjects J Nešetřil, A Pultr Discrete Mathematics 22 (3), 287-300, 1978 | 140 | 1978 |
| On the maximum average degree and the oriented chromatic number of a graph OV Borodin, AV Kostochka, J Nešetřil, A Raspaud, É Sopena Discrete Mathematics 206 (1-3), 77-89, 1999 | 129 | 1999 |
| On nowhere dense graphs J Nešetřil, PO De Mendez European Journal of Combinatorics 32 (4), 600-617, 2011 | 124 | 2011 |
| Duality and polynomial testing of tree homomorphisms P Hell, J Nesetril, X Zhu Transactions of the American Mathematical Society 348 (4), 1281-1297, 1996 | 121 | 1996 |
| Constraint satisfaction with countable homogeneous templates M Bodirsky, J Nešetřil Journal of Logic and Computation 16 (3), 359-373, 2006 | 120 | 2006 |
| Ramsey classes of set systems J Nešetřil, V Rödl Journal of Combinatorial Theory, Series A 34 (2), 183-201, 1983 | 116 | 1983 |
| A short proof of the existence of highly chromatic hypergraphs without short cycles J Nešetřil, V Rödl Journal of Combinatorial Theory, Series B 27 (2), 225-227, 1979 | 105 | 1979 |
David R. WoodSchool of Mathematics, Monash UniversityVerified email at monash.edu
