Random perturbation of sparse graphs M Hahn-Klimroth, GS Maesaka, Y Mogge, S Mohr, O Parczyk arXiv preprint arXiv:2004.04672, 2020 | 19 | 2020 |
Quasirandom latin squares JW Cooper, D Král', A Lamaison, S Mohr Random Structures & Algorithms 61 (2), 298-308, 2022 | 12 | 2022 |
Long cycles and spanning subgraphs of locally maximal 1‐planar graphs I Fabrici, J Harant, T Madaras, S Mohr, R Soták, CT Zamfirescu Journal of Graph Theory 95 (1), 125-137, 2020 | 12 | 2020 |
Uniform Turán density of cycles M Bucić, J Cooper, D Kráľ, S Mohr, D Munhá Correia Transactions of the American Mathematical Society 376 (07), 4765-4809, 2023 | 7 | 2023 |
On the circumference of essentially 4-connected planar graphs I Fabrici, J Harant, S Mohr, J Schmidt Journal of graph algorithms and applications 24 (1), 21-46, 2020 | 7 | 2020 |
Longer cycles in essentially 4-connected planar graphs I Fabrici, J Harant, S Mohr, JM Schmidt Discussiones Mathematicae Graph Theory 40 (1), 269-277, 2020 | 5 | 2020 |
On Selkow’s bound on the independence number of graphs J Harant, S Mohr Discussiones Mathematicae Graph Theory 39 (3), 655-657, 2019 | 4 | 2019 |
Rooted complete minors in line graphs with a Kempe coloring M Kriesell, S Mohr Graphs and Combinatorics 35 (2), 551-557, 2019 | 2 | 2019 |
Rooted minors and locally spanning subgraphs T Böhme, J Harant, M Kriesell, S Mohr, JM Schmidt Journal of Graph Theory 105 (2), 209-229, 2024 | 1 | 2024 |
Kempe chains and rooted minors M Kriesell, S Mohr arXiv preprint arXiv:1911.09998, 2019 | 1 | 2019 |
Even longer cycles in essentially 4-connected planar graphs I Fabrici, J Harant, S Mohr, JM Schmidt arXiv preprint arXiv:1806.09413, 2018 | 1 | 2018 |
Maximum weighted induced subgraphs J Harant, S Mohr Discrete Mathematics 339 (7), 1954-1959, 2016 | 1 | 2016 |
Über untere Schranken zur Unabhängigkeit in Graphen S Mohr Technische Universität Ilmenau, 2016 | 1 | 2016 |
New bounds on domination and independence in graphs J Harant, S Mohr Discussiones Mathematicae Graph Theory, 2023 | | 2023 |
Spanning trees of smallest maximum degree in subdivisions of graphs C Brause, J Harant, F Hörsch, S Mohr arXiv preprint arXiv:2210.04669, 2022 | | 2022 |
Uniform Tur\'an density of cycles M Bucić, JW Cooper, D Kráľ, S Mohr, DM Correia arXiv preprint arXiv:2112.01385, 2021 | | 2021 |
A construction of uniquely colourable graphs with equal colour class sizes S Mohr Discrete Applied Mathematics 303, 122-126, 2021 | | 2021 |
Rooted structures in graphs S Mohr TEMat monográficos 2, 95-98, 2021 | | 2021 |
Strong modeling limits of graphs with bounded tree-width A Grzesik, D Kráľ, S Mohr Extended Abstracts EuroComb 2021: European Conference on Combinatorics …, 2021 | | 2021 |
Rooted structures in graphs: a project on Hadwiger's conjecture, rooted minors, and Tutte cycles S Mohr Dissertation, Ilmenau, TU Ilmenau, 2020, 2020 | | 2020 |