Samuel Mohr

16 papers Journal 16
YearRankTypeTitle / Venue / Authors
2026 J jnl
Strong modeling limits of graphs with bounded tree-width.
Eur. J. Comb.
Andrzej Grzesik, Daniel Král, Samuel Mohr
2024 J jnl
Rooted minors and locally spanning subgraphs.
J. Graph Theory
Thomas Böhme, Jochen Harant, Matthias Kriesell, Samuel Mohr, Jens M. Schmidt
2023 J jnl
New bounds on domination and independence in graphs.
Discuss. Math. Graph Theory
Jochen Harant, Samuel Mohr
2022 J jnl
Quasirandom Latin squares.
Random Struct. Algorithms
Jacob W. Cooper, Daniel Král', Ander Lamaison, Samuel Mohr
2022 J jnl
Spanning trees of smallest maximum degree in subdivisions of graphs.
CoRR
Christoph Brause, Jochen Harant, Florian Hörsch, Samuel Mohr
2021 J jnl
A construction of uniquely colourable graphs with equal colour class sizes.
Discret. Appl. Math.
Samuel Mohr
2021 J jnl
Circumference of essentially 4-connected planar triangulations.
J. Graph Algorithms Appl.
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2021 J jnl
Random Perturbation of Sparse Graphs.
Electron. J. Comb.
Max Hahn-Klimroth, Giulia S. Maesaka, Yannick Mogge, Samuel Mohr, Olaf Parczyk
2020 J jnl
Long cycles and spanning subgraphs of locally maximal 1-planar graphs.
J. Graph Theory
Igor Fabrici, Jochen Harant, Tomás Madaras, Samuel Mohr, Roman Soták, Carol T. Zamfirescu
2020 J jnl
Longer cycles in essentially 4-connected planar graphs.
Discuss. Math. Graph Theory
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2020 J jnl
On the Circumference of Essentially 4-connected Planar Graphs.
J. Graph Algorithms Appl.
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2019 J jnl
On Selkow's bound on the independence number of graphs.
Discuss. Math. Graph Theory
Jochen Harant, Samuel Mohr
2019 J jnl
Rooted Complete Minors in Line Graphs with a Kempe Coloring.
Graphs Comb.
Matthias Kriesell, Samuel Mohr
2018 J jnl
Even Longer Cycles in Essentially 4-Connected Planar Graphs.
CoRR
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2017 J jnl
Longer Cycles in Essentially 4-Connected Planar Graphs.
CoRR
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2016 J jnl
Maximum weighted induced subgraphs.
Discret. Math.
Jochen Harant, Samuel Mohr