| Orientations making k-cycles cyclic | 0 | 0.34 | 2016 |
| Relations between the local chromatic number and its directed version | 1 | 0.35 | 2015 |
| Colourful Theorems and Indices of Homomorphism Complexes. | 5 | 0.54 | 2013 |
| Local chromatic number of quadrangulations of surfaces | 1 | 0.37 | 2013 |
| Gallai colorings and domination in multipartite digraphs | 3 | 0.50 | 2012 |
| Families of Graph-different Hamilton Paths | 3 | 0.50 | 2012 |
| On directed local chromatic number, shift graphs, and Borsuk-like graphs | 5 | 0.77 | 2011 |
| Permutation Capacities and Oriented Infinite Paths | 0 | 0.34 | 2011 |
| Families of Very Different Paths. | 0 | 0.34 | 2011 |
| On topological relaxations of chromatic conjectures | 4 | 0.72 | 2010 |
| Permutation Capacities of Families of Oriented Infinite Paths | 9 | 0.98 | 2010 |
| Necklace Bisection with One Cut Less than Needed. | 0 | 0.34 | 2008 |
| Graph-Different Permutations | 3 | 0.51 | 2008 |
| On types of growth for graph-different permutations | 4 | 0.52 | 2007 |
| Colorful subgraphs in Kneser-like graphs | 11 | 0.98 | 2007 |
| Local Chromatic Number, KY Fan's Theorem, And Circular Colorings | 39 | 2.66 | 2006 |
| Asymptotic values of the Hall-ratio for graph powers | 5 | 0.57 | 2006 |
| Local chromatic number and Sperner capacity | 20 | 1.22 | 2005 |
| Connected matchings and Hadwiger's conjecture | 4 | 0.68 | 2005 |
| Edge colorings of complete graphs without tricolored triangles | 32 | 2.50 | 2004 |
| Perfection, Imperfection, and Graph Entropy | 0 | 0.34 | 2000 |
| Orientations of self-complementary graphs and the relation of Sperner and Shannon capacities | 11 | 1.28 | 1999 |
| Intersecting set systems and graphic matroids | 0 | 0.34 | 1998 |
| Different capacities of a digraph | 4 | 0.56 | 1994 |
| On the optimal structure of recovering set pairs in lattices: the sandglass conjecture | 7 | 0.84 | 1994 |
| Perfect couples of graphs | 12 | 1.49 | 1992 |
| A Sperner-type theorem and qualitative independence | 24 | 4.79 | 1992 |
| Entropy Splitting For Antiblocking Corners And Perfect Graphs | 13 | 1.69 | 1990 |
| Coding For Write-Unidirectional Memories And Conflict-Resolution | 4 | 0.57 | 1989 |
| Separating partition systems and locally different sequences | 25 | 2.17 | 1988 |
