default search action
Samuel Mohr
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Thomas Böhme, Jochen Harant, Matthias Kriesell
, Samuel Mohr
Rooted minors and locally spanning subgraphs. J. Graph Theory 105(2): 209-229 (2024) - 2023
- [j11]Jochen Harant, Samuel Mohr:
New bounds on domination and independence in graphs. Discuss. Math. Graph Theory 43(3): 809-824 (2023) - 2022
- [j10]Jacob W. Cooper, Daniel Král'
Quasirandom Latin squares. Random Struct. Algorithms 61(2): 298-308 (2022) - [i3]Christoph Brause, Jochen Harant, Florian Hörsch, Samuel Mohr:
Spanning trees of smallest maximum degree in subdivisions of graphs. CoRR abs/2210.04669 (2022) - 2021
- [j9]Max Hahn-Klimroth
Random Perturbation of Sparse Graphs. Electron. J. Comb. 28(2): 2 (2021) - [j8]Samuel Mohr
A construction of uniquely colourable graphs with equal colour class sizes. Discret. Appl. Math. 303: 122-126 (2021) - [j7]Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
Circumference of essentially 4-connected planar triangulations. J. Graph Algorithms Appl. 25(1): 121-132 (2021) - 2020
- [j6]Igor Fabrici
Longer cycles in essentially 4-connected planar graphs. Discuss. Math. Graph Theory 40(1): 269-277 (2020) - [j5]Igor Fabrici
On the Circumference of Essentially 4-connected Planar Graphs. J. Graph Algorithms Appl. 24(1): 21-46 (2020) - [j4]Igor Fabrici
Long cycles and spanning subgraphs of locally maximal 1-planar graphs. J. Graph Theory 95(1): 125-137 (2020)
2010 – 2019
- 2019
- [j3]Jochen Harant, Samuel Mohr:
On Selkow's bound on the independence number of graphs. Discuss. Math. Graph Theory 39(3): 655-657 (2019) - [j2]Matthias Kriesell, Samuel Mohr
Rooted Complete Minors in Line Graphs with a Kempe Coloring. Graphs Comb. 35(2): 551-557 (2019) - 2018
- [i2]Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt:
Even Longer Cycles in Essentially 4-Connected Planar Graphs. CoRR abs/1806.09413 (2018) - 2017
- [i1]Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt:
Longer Cycles in Essentially 4-Connected Planar Graphs. CoRR abs/1710.05619 (2017) - 2016
- [j1]Jochen Harant, Samuel Mohr
Maximum weighted induced subgraphs. Discret. Math. 339(7): 1954-1959 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: