Samuel Mohr

According to our database, Samuel Mohr authored at least 15 papers between 2016 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Strong modeling limits of graphs with bounded tree-width.

Andrzej Grzesik, Daniel Král, Samuel Mohr

Eur. J. Comb., 2026

2024

Rooted minors and locally spanning subgraphs.

Thomas Böhme, Jochen Harant, Matthias Kriesell, Samuel Mohr, Jens M. Schmidt

J. Graph Theory, February, 2024

2023

New bounds on domination and independence in graphs.

Jochen Harant, Samuel Mohr

Discuss. Math. Graph Theory, 2023

2022

Quasirandom Latin squares.

Jacob W. Cooper, Daniel Král', Ander Lamaison, Samuel Mohr

Random Struct. Algorithms, 2022

Spanning trees of smallest maximum degree in subdivisions of graphs.

Christoph Brause, Jochen Harant, Florian Hörsch, Samuel Mohr

CoRR, 2022

2021

Circumference of essentially 4-connected planar triangulations.

Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt

J. Graph Algorithms Appl., 2021

A construction of uniquely colourable graphs with equal colour class sizes.

Samuel Mohr

Discret. Appl. Math., 2021

Random Perturbation of Sparse Graphs.

Max Hahn-Klimroth, Giulia S. Maesaka, Yannick Mogge, Samuel Mohr, Olaf Parczyk

Electron. J. Comb., 2021

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

On the Circumference of Essentially 4-connected Planar Graphs.

Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt

J. Graph Algorithms Appl., 2020

Longer cycles in essentially 4-connected planar graphs.

Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt

Discuss. Math. Graph Theory, 2020

2019

Rooted Complete Minors in Line Graphs with a Kempe Coloring.

Matthias Kriesell, Samuel Mohr

Graphs Comb., 2019

On Selkow's bound on the independence number of graphs.

Jochen Harant, Samuel Mohr

Discuss. Math. Graph Theory, 2019

2018

Even Longer Cycles in Essentially 4-Connected Planar Graphs.

Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt

CoRR, 2018

2016

Maximum weighted induced subgraphs.

Jochen Harant, Samuel Mohr

Discret. Math., 2016