| Graph coloring problems TR Jensen, B Toft John Wiley & Sons, 2011 | 2149 | 2011 |
| Graph edge coloring: Vizing's theorem and Goldberg's conjecture M Stiebitz, D Scheide, B Toft, LM Favrholdt John Wiley & Sons, 2012 | 107 | 2012 |
| Non-separating induced cycles in graphs C Thomassen, B Toft Journal of combinatorial theory, Series B 31 (2), 199-224, 1981 | 87 | 1981 |
| On interval colourings of bi-regular bipartite graph D Hanson, COM Loten, B Toft Ars Combinatoria 50, 23-32, 1998 | 84 | 1998 |
| Cyclic coloration of 3‐polytopes MD Plummer, B Toft Journal of graph theory 11 (4), 507-515, 1987 | 78 | 1987 |
| A survey of Hadwiger's conjecture B Toft Congressus Numerantium, 249-283, 1996 | 68 | 1996 |
| Any 7-chromatic graphs has k 7 or k 4, 4 as a minor K Kawarabayashi, B Toft Combinatorica 25 (3), 327-353, 2005 | 63 | 2005 |
| Graph coloring problems Tommy R.. Jensen, B Toft J. Wiley & sons, 1995 | 56* | 1995 |
| On a special case of Hadwiger's conjecture M Plummer, M Stiebitz, B Toft Discussiones Mathematicae Graph Theory 23 (2), 333-363, 2003 | 51 | 2003 |
| Variable degeneracy: extensions of Brooksą and Gallai's theorems OV Borodin, AV Kostochka, B Toft Discrete Mathematics 214 (1-3), 101-112, 2000 | 47 | 2000 |
| On critical subgraphs of colour-critical graphs B Toft Discrete Mathematics 7 (3-4), 377-392, 1974 | 43 | 1974 |
| Color-critical graphs and hypergraphs B Toft Journal of Combinatorial Theory, Series B 16 (2), 145-161, 1974 | 41 | 1974 |
| On colour-critical hypergraphs B Toft Aarhus Universitet. Matematisk Institut, 1973 | 40 | 1973 |
| On the maximal number of edges of critical k-chromatic graphs B Toft Aarhus Universitet. Matematisk Institut, 1970 | 36 | 1970 |
| Graph edge colouring: Vizing's theorem and Goldberg's conjecture LM Favrholdt, M Stiebitz, B Toft Institut for Matematik og Datalogi, Syddansk Universitet, 2006 | 33 | 2006 |
| A lower bound for interval colouring bi-regular bipartite graphs D Hanson, COM Loten, B Toft Bulletin of the ICA 18, 69-74, 1996 | 33 | 1996 |
| The Cartesian product of a k-extendable and an l-extendable graph is (k+ l+ 1)-extendable E Gyori, MD Plummer VANDERBILT UNIV NASHVILLE TN DEPT OF MATHEMATICS, 1991 | 30 | 1991 |
| Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture K Kawarabayashi, MD Plummer, B Toft Journal of Combinatorial Theory, Series B 95 (1), 152-167, 2005 | 27 | 2005 |
| Julius Petersen 1839–1910 a biography J Lützen, G Sabidussi, B Toft Discrete Mathematics 100 (1-3), 9-82, 1992 | 26 | 1992 |
| Choosability versus chromaticity TR Jensen, B Toft Odense Universitet. Institut for Matematik og Datalogi, 1995 | 25 | 1995 |
