Graph coloring problems TR Jensen, B Toft John Wiley & Sons, 2011 | 2546 | 2011 |
Highly connected sets and the excluded grid theorem R Diestel, TR Jensen, KY Gorbunov, C Thomassen Journal of Combinatorial Theory, Series B 75 (1), 61-73, 1999 | 195 | 1999 |
Small graphs with chromatic number 5: a computer search T Jensen, GF Royle Journal of Graph Theory 19 (1), 107-116, 1995 | 76 | 1995 |
On graphs with strongly independent color‐classes A Gyárfás, T Jensen, M Stiebitz Journal of Graph Theory 46 (1), 1-14, 2004 | 69 | 2004 |
Batched bin packing G Gutin, T Jensen, A Yeo Discrete Optimization 2 (1), 71-82, 2005 | 50 | 2005 |
Characterization of edge‐colored complete graphs with properly colored Hamilton paths J Feng, HE Giesen, Y Guo, G Gutin, T Jensen, A Rafiey Journal of Graph Theory 53 (4), 333-346, 2006 | 40 | 2006 |
5-stars of low weight in normal plane maps with minimum degree 5 OV Borodin, AO Ivanova, TR Jensen Discussiones Mathematicae Graph Theory 34 (3), 539-546, 2014 | 38 | 2014 |
Describing 3-paths in normal plane maps OV Borodin, AO Ivanova, TR Jensen, AV Kostochka, MP Yancey Discrete Mathematics 313 (23), 2702-2711, 2013 | 37 | 2013 |
Choosability versus chromaticity TR Jensen, B Toft Odense Universitet. Institut for Matematik og Datalogi, 1995 | 29 | 1995 |
Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable. OV Borodin, AN Glebov, TR Jensen, A Raspaud Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only] 3, 428-440, 2006 | 27 | 2006 |
Decompositions of graphs into trees, forests, and regular subgraphs S Akbari, TR Jensen, M Siggers Discrete Mathematics 338 (8), 1322-1327, 2015 | 23 | 2015 |
Dense critical and vertex-critical graphs TR Jensen Discrete Mathematics 258 (1-3), 63-84, 2002 | 21 | 2002 |
The color space of a graph TR Jensen, C Thomassen Journal of Graph Theory 34 (3), 234-245, 2000 | 21 | 2000 |
On-line bin packing with two item sizes G Gutin, T Jensen, A Yeo Algorithmic Operations Research 1 (2), 72-78, 2006 | 20 | 2006 |
Domination analysis for minimum multiprocessor scheduling G Gutin, T Jensen, A Yeo Discrete applied mathematics 154 (18), 2613-2619, 2006 | 14 | 2006 |
On the weighted safe set problem on paths and cycles S Fujita, T Jensen, B Park, T Sakuma Journal of Combinatorial Optimization 37, 685-701, 2019 | 13 | 2019 |
25 Pretty graph colouring problems TR Jensen, B Toft Discrete Mathematics 229 (1), 167-170, 2001 | 13 | 2001 |
Unsolved graph colouring problems T Jensen, B Toft Topics in Chromatic Graph Theory, 327-357, 2015 | 12 | 2015 |
Hajós constructions of critical graphs TR Jensen, GF Royle Journal of Graph Theory 30 (1), 37-50, 1999 | 12 | 1999 |
On semiextensions and circuit double covers EGM Esteva, TR Jensen Journal of Combinatorial Theory, Series B 97 (3), 474-482, 2007 | 8 | 2007 |