Maximum weighted induced subgraphs. - Jochen Harant; Samuel Mohr (Discret. Math., 2016)

Even Longer Cycles in Essentially 4-Connected Planar Graphs. - Igor Fabrici; Jochen Harant; Samuel Mohr; Jens M. Schmidt (CoRR, 2018)

On Selkow's bound on the independence number of graphs. - Jochen Harant; Samuel Mohr (Discuss. Math. Graph Theory, 2019)

Rooted Complete Minors in Line Graphs with a Kempe Coloring. - Matthias Kriesell; Samuel Mohr (Graphs Comb., 2019)

Longer cycles in essentially 4-connected planar graphs. - Igor Fabrici; Jochen Harant; Samuel Mohr; Jens M. Schmidt (Discuss. Math. Graph Theory, 2020)

On the Circumference of Essentially 4-connected Planar Graphs. - Igor Fabrici; Jochen Harant; Samuel Mohr; Jens M. Schmidt (J. Graph Algorithms Appl., 2020)

Long cycles and spanning subgraphs of locally maximal 1-planar graphs. - Igor Fabrici; Jochen Harant; Tomás Madaras; Samuel Mohr; Roman Soták; Carol T. Zamfirescu (J. Graph Theory, 2020)

Random Perturbation of Sparse Graphs. - Max Hahn-Klimroth; Giulia S. Maesaka; Yannick Mogge; Samuel Mohr; Olaf Parczyk (Electron. J. Comb., 2021)

A construction of uniquely colourable graphs with equal colour class sizes. - Samuel Mohr (Discret. Appl. Math., 2021)

Circumference of essentially 4-connected planar triangulations. - Igor Fabrici; Jochen Harant; Samuel Mohr; Jens M. Schmidt (J. Graph Algorithms Appl., 2021)

Spanning trees of smallest maximum degree in subdivisions of graphs. - Christoph Brause; Jochen Harant; Florian Hörsch; Samuel Mohr (CoRR, 2022)

Quasirandom Latin squares. - Jacob W. Cooper; Daniel Král'; Ander Lamaison; Samuel Mohr (Random Struct. Algorithms, 2022)

New bounds on domination and independence in graphs. - Jochen Harant; Samuel Mohr (Discuss. Math. Graph Theory, 2023)

Rooted minors and locally spanning subgraphs. - Thomas Böhme 001; Jochen Harant; Matthias Kriesell; Samuel Mohr; Jens M. Schmidt (J. Graph Theory, 2024)