![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 299 matches
- 2024
- Bojan Mohar
, Petr Skoda:
Excluded minors for the Klein bottle I. Low connectivity case. J. Comb. Theory B 164: 299-320 (2024) - Bojan Mohar, Petr Skoda:
Excluded minors for the Klein bottle II. Cascades. J. Comb. Theory B 166: 80-108 (2024) - Robert Hickingbotham, Freddie Illingworth
, Bojan Mohar
, David R. Wood
:
Treewidth, Circle Graphs, and Circular Drawings. SIAM J. Discret. Math. 38(1): 965-987 (2024) - Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal:
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. SODA 2024: 1177-1193 - Bojan Mohar, Igor Shinkar, Ryan O'Donnell:
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, BC, Canada, June 24-28, 2024. ACM 2024 [contents] - Vesna Irsic, Bojan Mohar, Alexandra Wesolek:
Cops and Robber on Hyperbolic Manifolds. CoRR abs/2402.05753 (2024) - Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Tomohiro Sonobe:
Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem. CoRR abs/2405.16586 (2024) - Sebastián González Hermosillo de la Maza, Bojan Mohar:
Guarding isometric subgraphs and Cops and Robber in planar graphs. CoRR abs/2406.01068 (2024) - 2023
- Rutger Campbell, Marc Distel, J. Pascal Gollin
, Daniel J. Harvey, Kevin Hendrey, Robert Hickingbotham, Bojan Mohar, David R. Wood:
Graphs of Linear Growth have Bounded Treewidth. Electron. J. Comb. 30(3) (2023) - Jesse Campion Loth, Bojan Mohar:
Expected number of faces in a random embedding of any graph is at most linear. Comb. Probab. Comput. 32(4): 682-690 (2023) - Yaobin Chen, Bojan Mohar, Hehui Wu
:
Proper orientations and proper chromatic number. J. Comb. Theory B 161: 63-85 (2023) - Michael Krivelevich, Bojan Mohar:
Robin Thomas (1962-2020). J. Comb. Theory B 158(Part): 1-2 (2023) - Peter Bradshaw
, Seyyed Aliasghar Hosseini
, Bojan Mohar
, Ladislav Stacho:
On the cop number of graphs of high girth. J. Graph Theory 102(1): 15-34 (2023) - Zdenek Dvorák
, Bojan Mohar
:
On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs. SIAM J. Discret. Math. 37(2): 699-717 (2023) - 2022
- Bojan Mohar, Hehui Wu:
Subgraphs of Kneser graphs with large girth and large chromatic number. Art Discret. Appl. Math. 6(2): 2 (2022) - Éric Colin de Verdière, Thomas Magnard, Bojan Mohar:
Embedding Graphs into Two-Dimensional Simplicial Complexes. Comput. Geom. Topol. 1(1): 6:1-6:23 (2022) - Drago Bokal, Zdenek Dvorák, Petr Hlinený
, Jesús Leaños, Bojan Mohar, Tilo Wiedera:
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12. Comb. 42(5): 701-728 (2022) - Bojan Mohar, Hehui Wu:
Triangle-free subgraphs with large fractional chromatic number. Comb. Probab. Comput. 31(1): 136-143 (2022) - Haiyan Chen, Bojan Mohar:
The Sandpile Group of Polygon Rings and Twisted Polygon Rings. Graphs Comb. 38(4): 113 (2022) - Seyyed Aliasghar Hosseini, Bojan Mohar
, Mohammad Bagher Ahmadi:
The evolution of the structure of ABC-minimal trees. J. Comb. Theory B 152: 415-452 (2022) - Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal:
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. CoRR abs/2211.01032 (2022) - 2021
- Édouard Bonnet, Sergio Cabello
, Bojan Mohar, Hebert Pérez-Rosés
:
The Inverse Voronoi Problem in Graphs II: Trees. Algorithmica 83(5): 1165-1200 (2021) - Fiachra Knox, Bojan Mohar, Nathan Singer
:
Reflexive coloring complexes for 3-edge-colorings of cubic graphs. Discret. Math. 344(4): 112309 (2021) - Bojan Mohar, Nathan Singer:
The last temptation of William T. Tutte. Eur. J. Comb. 91: 103221 (2021) - Matt DeVos, Matthew Drescher, Daryl Funk, Sebastián González Hermosillo de la Maza, Krystal Guo
, Tony Huynh
, Bojan Mohar
, Amanda Montejano
:
Short rainbow cycles in graphs and matroids. J. Graph Theory 96(2): 192-202 (2021) - Seyyed Aliasghar Hosseini
, Bojan Mohar
, Sebastián González Hermosillo de la Maza:
Meyniel's conjecture on graphs of bounded degree. J. Graph Theory 97(3): 401-407 (2021) - Sebastián González Hermosillo de la Maza, Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar, Bruce A. Reed:
Cops and robbers on oriented toroidal grids. Theor. Comput. Sci. 857: 166-176 (2021) - Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman:
Automorphisms and Isomorphisms of Maps in Linear Time. ICALP 2021: 86:1-86:15 - Jesse Campion Loth, Kevin Halasz, Tomás Masarík
, Bojan Mohar, Robert Sámal:
Random 2-cell embeddings of multistars. CoRR abs/2103.05036 (2021) - 2020
- Édouard Bonnet, Sergio Cabello
, Bojan Mohar, Hebert Pérez-Rosés
:
The Inverse Voronoi Problem in Graphs I: Hardness. Algorithmica 82(10): 3018-3040 (2020)
skipping 269 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 09:44 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint