| Monochromatic cycle partitions of graphs with large minimum degree L DeBiasio, LL Nelsen Journal of Combinatorial Theory, Series B 122, 634-667, 2017 | 27 | 2017 |
| On the strong chromatic index of sparse graphs P DeOrsey, J Diemunsch, M Ferrara, N Graber, SG Hartke, ... arXiv preprint arXiv:1508.03515, 2015 | 11 | 2015 |
| Color-blind index in graphs of very low degree J Diemunsch, N Graber, L Kramer, V Larsen, LM Nelsen, LL Nelsen, ... Discrete Applied Mathematics 225, 122-129, 2017 | 3 | 2017 |
| Computational methods for graph choosability and applications to list coloring problems L Nelsen PhD thesis, University of Colorado Denver, 2019 | 2 | 2019 |
| Erd\H {o} s-Szekeres On-Line K Boyer, LM Nelsen, LL Nelsen, F Pfender, E Reiland, R Solava arXiv preprint arXiv:1804.05952, 2018 | 1 | 2018 |
| Erdős-Szekeres On-Line K Boyer, LM Nelsen, LL Nelsen, F Pfender, E Reiland, R Solava arXiv e-prints, arXiv: 1804.05952, 2018 | | 2018 |
| Monochromatic subgraphs of 2-edge-colored graphs L Nelsen | | 2014 |
| Subcubic planar graphs are 7-square-choosable SG Hartke, L Nelsen 2020 Fall Western Virtual Sectional Meeting, 0 | | |
