Samuel Mohr

Orcid: 0000-0002-9947-821X

According to our database¹, Samuel Mohr authored at least 14 papers between 2016 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

Rooted minors and locally spanning subgraphs.

[BibT_eX]

[DOI]

J. Graph Theory, February, 2024

2023

New bounds on domination and independence in graphs.

[BibT_eX]

[DOI]

Jochen Harant

Samuel Mohr

Discuss. Math. Graph Theory, 2023

2022

Quasirandom Latin squares.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2022

Spanning trees of smallest maximum degree in subdivisions of graphs.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Circumference of essentially 4-connected planar triangulations.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2021

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

[BibT_eX]

[DOI]

Samuel Mohr

Discret. Appl. Math., 2021

Random Perturbation of Sparse Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

2020

Long cycles and spanning subgraphs of locally maximal 1-planar graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

On the Circumference of Essentially 4-connected Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2020

Longer cycles in essentially 4-connected planar graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2020

2019

Rooted Complete Minors in Line Graphs with a Kempe Coloring.

[BibT_eX]

[DOI]

Matthias Kriesell

Samuel Mohr

Graphs Comb., 2019

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

[BibT_eX]

[DOI]

Jochen Harant

Samuel Mohr

Discuss. Math. Graph Theory, 2019

2018

Even Longer Cycles in Essentially 4-Connected Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2018

2016

Maximum weighted induced subgraphs.

[BibT_eX]

[DOI]

Jochen Harant

Samuel Mohr

Discret. Math., 2016

Samuel Mohr

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...