| Best monotone degree conditions for graph properties: a survey D Bauer, HJ Broersma, J van den Heuvel, N Kahl, A Nevo, E Schmeichel, ... Graphs and combinatorics 31 (1), 1-22, 2015 | 41 | 2015 |
| Sufficient degree conditions for k‐edge‐connectedness of a graph D Bauer, SL Hakimi, N Kahl, E Schmeichel Networks: An International Journal 54 (2), 95-98, 2009 | 28 | 2009 |
| Toughness and vertex degrees D Bauer, HJ Broersma, J van den Heuvel, N Kahl, E Schmeichel Journal of graph theory 72 (2), 209-219, 2013 | 21 | 2013 |
| Tutte sets in graphs II: The complexity of finding maximum Tutte sets D Bauer, HJ Broersma, N Kahl, A Morgana, E Schmeichel, T Surowiec Discrete applied mathematics 155 (10), 1336-1343, 2007 | 20 | 2007 |
| Best monotone degree conditions for binding number D Bauer, M Yatauro, N Kahl, E Schmeichel Discrete mathematics 311 (18-19), 2037-2043, 2011 | 16 | 2011 |
| Degree Sequences and the Existence of k-Factors D Bauer, HJ Broersma, J van den Heuvel, N Kahl, E Schmeichel Graphs and combinatorics 28 (2), 149-166, 2012 | 13 | 2012 |
| Best monotone degree bounds for various graph parameters D Bauer, SL Hakimi, N Kahl, E Schmeichel, D Bauer, SL Hakimi, N Kahl, ... Congr. Numer 192, 75-83, 2008 | 13 | 2008 |
| Graphs with the maximum or minimum number of 1-factors D Gross, N Kahl, JT Saccoman Discrete mathematics 310 (4), 687-691, 2010 | 12 | 2010 |
| On maximum graphs in Tutte polynomial posets N Kahl, K Luttrell Discrete Applied Mathematics 339, 78-88, 2023 | 9 | 2023 |
| Extremal graphs for the Tutte polynomial N Kahl Journal of Combinatorial Theory, Series B 152, 121-152, 2022 | 8 | 2022 |
| Toughness and binding number D Bauer, N Kahl, E Schmeichel, DR Woodall, M Yatauro Discrete Applied Mathematics 165, 60-68, 2014 | 8 | 2014 |
| A note on the values of independence polynomials at− 1 J Cutler, N Kahl Discrete Mathematics 339 (11), 2723-2726, 2016 | 7 | 2016 |
| Generalizing D-graphs A Busch, M Ferrara, N Kahl Discrete applied mathematics 155 (18), 2487-2495, 2007 | 7 | 2007 |
| Graph vulnerability parameters, compression, and threshold graphs N Kahl Discrete Applied Mathematics 292, 108-116, 2021 | 5 | 2021 |
| Graph vulnerability parameters, compression, and quasi-threshold graphs N Kahl Discrete Applied Mathematics 259, 119-126, 2019 | 5 | 2019 |
| Long cycles in 2-connected triangle-free graphs D Bauer, N Kahl, L McGuire, E Schmeichel Ars Combinatoria 86, 295-304, 2008 | 5 | 2008 |
| On constructing rational spanning tree edge densities N Kahl Discrete Applied Mathematics 213, 224-232, 2016 | 4 | 2016 |
| Improving theorems in a best monotone sense D Bauer, N Kahl, E Schmeichel, DR Woodall, M Yatauro Congr. Numer 216, 87-95, 2013 | 1 | 2013 |
| On maximum graphs in Tutte polynomial posets (vol 339, pg 78, 2023) N Kahl, K Luttrell, P Romero DISCRETE APPLIED MATHEMATICS 371, 276-277, 2025 | | 2025 |
| Corrigendum to “On maximum graphs in Tutte polynomial posets”[Discrete Appl. Math. 339 (2023) 78–88] N Kahl, K Luttrell, P Romero Discrete Applied Mathematics, 2025 | | 2025 |
