| List edge and list total colourings of multigraphs OV Borodin, AV Kostochka, DR Woodall Journal of combinatorial theory, Series B 71 (2), 184-204, 1997 | 352 | 1997 |
| Lower bound of the Hadwiger number of graphs by their average degree AV Kostochka Combinatorica 4 (4), 307-316, 1984 | 343 | 1984 |
| The minimum Hadwiger number for graphs with a given mean degree of vertices AV Kostochka Metody Diskret. Analiz., 37-58, 1982 | 222 | 1982 |
| On an upper bound of a graph's chromatic number, depending on the graph's degree and density OV Borodin, AV Kostochka Journal of Combinatorial Theory, Series B 23 (2-3), 247-250, 1977 | 195 | 1977 |
| The total chromatic number of any multigraph with maximum degree five is at most seven AV Kostochka Discrete Mathematics 162 (1-3), 199-214, 1996 | 173 | 1996 |
| Acyclic and oriented chromatic numbers of graphs AV Kostochka, É Sopena, X Zhu Journal of Graph Theory 24 (4), 331-340, 1997 | 170 | 1997 |
| The total coloring of a multigraph with maximal degree 4 AV Kostochka Discrete Mathematics 17 (2), 161-163, 1977 | 145 | 1977 |
| A short proof of the Hajnal–Szemerédi theorem on equitable colouring HA Kierstead, AV Kostochka Combinatorics, Probability and Computing 17 (2), 265-270, 2008 | 142 | 2008 |
| 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 | 140 | 1999 |
| Covering and coloring polygon-circle graphs A Kostochka, J Kratochvíl Discrete Mathematics 163 (1-3), 299-305, 1997 | 139 | 1997 |
| Total colorings of planar graphs with large maximum degree OV Borodin, AV Kostochka, DR Woodall Journal of graph theory 26 (1), 53-59, 1997 | 126 | 1997 |
| Acyclic colouring of 1-planar graphs OV Borodin, AV Kostochka, A Raspaud, E Sopena Discrete Applied Mathematics 114 (1-3), 29-41, 2001 | 111 | 2001 |
| Acyclic colourings of planar graphs with large girth OV Borodin, AV Kostochka, DR Woodall Journal of the London Mathematical Society 60 (2), 344-352, 1999 | 107 | 1999 |
| A fast algorithm for equitable coloring HA Kierstead, AV Kostochka, M Mydlarz, E Szemerédi Combinatorica 30 (2), 217-224, 2010 | 106 | 2010 |
| Note to the paper of Grünbaum on acyclic colorings AV Kostochka, LS Mel'nikov Discrete Mathematics 14 (4), 403-406, 1976 | 101 | 1976 |
| The colour theorems of Brooks and Gallai extended AV Kostochka, M Stiebitz, B Wirth Discrete Mathematics 162 (1-3), 299-303, 1996 | 92 | 1996 |
| A class of constructions for Turán’s (3, 4)-problem AV Kostochka Combinatorica 2, 187-192, 1982 | 91 | 1982 |
| Ore's conjecture on color-critical graphs is almost true A Kostochka, M Yancey Journal of Combinatorial Theory, Series B 109, 73-101, 2014 | 86 | 2014 |
| An Ore-type theorem on equitable coloring HA Kierstead, AV Kostochka Journal of Combinatorial Theory, Series B 98 (1), 226-234, 2008 | 86 | 2008 |
| Turán problems and shadows I: Paths and cycles A Kostochka, D Mubayi, J Verstraëte Journal of Combinatorial Theory, Series A 129, 57-79, 2015 | 85 | 2015 |
