default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBojan Mohar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j238]Peter Bradshaw, Yaobin Chen, Hao Ma, Bojan Mohar, Hehui Wu:
List-Avoiding Orientations. Comb. 44(5): 1091-1113 (2024)- [j237]Sebastián González Hermosillo de la Maza, Bojan Mohar:
Guarding isometric subgraphs and cops and robber in planar graphs. Eur. J. Comb. 119: 103809 (2024) - [j236]Bojan Mohar
, Petr Skoda:
Excluded minors for the Klein bottle I. Low connectivity case. J. Comb. Theory B 164: 299-320 (2024) - [j235]Bojan Mohar, Petr Skoda:
Excluded minors for the Klein bottle II. Cascades. J. Comb. Theory B 166: 80-108 (2024) - [j234]Robert Hickingbotham, Freddie Illingworth, Bojan Mohar, David R. Wood:
Treewidth, Circle Graphs, and Circular Drawings. SIAM J. Discret. Math. 38(1): 965-987 (2024) - [c35]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. FOCS 2024: 86-105 - [c34]Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi:
Exact Algorithms for Clustered Planarity with Linear Saturators. ISAAC 2024: 24:1-24:16 - [c33]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 - [e1]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] - [i29]Vesna Irsic, Bojan Mohar, Alexandra Wesolek:
Cops and Robber on Hyperbolic Manifolds. CoRR abs/2402.05753 (2024) - [i28]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) - [i27]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) - [i26]Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi:
Exact Algorithms for Clustered Planarity with Linear Saturators. CoRR abs/2409.19410 (2024) - 2023
- [j233]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) - [j232]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) - [j231]Michael Krivelevich, Bojan Mohar:
Robin Thomas (1962-2020). J. Comb. Theory B 158(Part): 1-2 (2023) - [j230]Yaobin Chen, Bojan Mohar, Hehui Wu:
Proper orientations and proper chromatic number. J. Comb. Theory B 161: 63-85 (2023) - [j229]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) - [j228]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
- [j227]Bojan Mohar, Hehui Wu:
Subgraphs of Kneser graphs with large girth and large chromatic number. Art Discret. Appl. Math. 6(2): 2 (2022) - [j226]É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) - [j225]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) - [j224]Timothy F. N. Chan, Daniel Král', Bojan Mohar, David R. Wood:
Inducibility and universality for trees. Comb. Theory 2(3) (2022) - [j223]Bojan Mohar, Hehui Wu:
Triangle-free subgraphs with large fractional chromatic number. Comb. Probab. Comput. 31(1): 136-143 (2022) - [j222]Haiyan Chen, Bojan Mohar:
The Sandpile Group of Polygon Rings and Twisted Polygon Rings. Graphs Comb. 38(4): 113 (2022) - [j221]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) - [i25]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
- [j220]É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) - [j219]Fiachra Knox, Bojan Mohar, Nathan Singer:
Reflexive coloring complexes for 3-edge-colorings of cubic graphs. Discret. Math. 344(4): 112309 (2021) - [j218]Bojan Mohar, Nathan Singer:
The last temptation of William T. Tutte. Eur. J. Comb. 91: 103221 (2021) - [j217]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) - [j216]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) - [j215]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) - [c32]Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman:
Automorphisms and Isomorphisms of Maps in Linear Time. ICALP 2021: 86:1-86:15 - [i24]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
- [j214]É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) - [j213]Gil Kalai, Bojan Mohar, Isabella Novik:
Guest Editors' Foreword. Discret. Comput. Geom. 64(2): 229-232 (2020) - [j212]Yifan Jing, Bojan Mohar:
The genus of complete 3-uniform hypergraphs. J. Comb. Theory B 141: 223-239 (2020) - [j211]Fiachra Knox, Bojan Mohar:
Maximum number of colourings: 4-chromatic graphs. J. Comb. Theory B 144: 95-118 (2020) - [j210]Michael Krivelevich, Bojan Mohar:
Ron Graham (1935-2020). J. Comb. Theory B 145: 521-522 (2020) - [j209]Bojan Mohar, Hehui Wu:
Fractional chromatic number of a random subgraph. J. Graph Theory 95(3): 467-472 (2020) - [j208]Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar:
Cops and Robbers on Graphs of Bounded Diameter. SIAM J. Discret. Math. 34(2): 1375-1384 (2020) - [c31]Marthe Bonamy, Bojan Mohar, Alexandra Wesolek:
Limiting Crossing Numbers for Geodesic Drawings on the Sphere. GD 2020: 341-355 - [i23]Peter Bradshaw, Seyyed Aliasghar Hosseini, Bojan Mohar, Ladislav Stacho:
On the cop number of graphs of high girth. CoRR abs/2005.10849 (2020) - [i22]Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman:
Automorphism groups of maps in linear time. CoRR abs/2008.01616 (2020) - [i21]Marthe Bonamy, Bojan Mohar, Alexandra Wesolek:
Limiting crossing numbers for geodesic drawings on the sphere. CoRR abs/2008.10459 (2020) - [i20]Yifan Jing, Bojan Mohar:
Efficient polynomial-time approximation scheme for the genus of dense graphs. CoRR abs/2011.08049 (2020)
2010 – 2019
- 2019
- [j207]Zdenek Dvorák, Bojan Mohar, Robert Sámal:
Exponentially Many Nowhere-Zero ℤ3-, ℤ4-, and ℤ6-Flows. Comb. 39(6): 1237-1253 (2019) - [j206]Fiachra Knox, Bojan Mohar:
Maximum Number of Colourings: 5-Chromatic Case. Electron. J. Comb. 26(3): 3 (2019) - [j205]Fiachra Knox, Bojan Mohar:
Fractional Decompositions and the Smallest-eigenvalue Separation. Electron. J. Comb. 26(4): 4 (2019) - [j204]Haiyan Chen, Bojan Mohar:
The sandpile group of a polygon flower. Discret. Appl. Math. 270: 68-82 (2019) - [j203]Fiachra Knox, Bojan Mohar, David R. Wood:
A Golden Ratio Inequality for Vertex Degrees of Graphs. Am. Math. Mon. 126(8): 742-747 (2019) - [c30]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. SoCG 2019: 14:1-14:15 - [i19]Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera:
Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12. CoRR abs/1903.05363 (2019) - [i18]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. CoRR abs/1904.10113 (2019) - [i17]Seyyed Aliasghar Hosseini, Bojan Mohar, Sebastián González Hermosillo de la Maza:
Meyniel's conjecture on graphs of bounded degree. CoRR abs/1912.06957 (2019) - [i16]Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar:
Cops and Robbers on graphs of bounded diameter. CoRR abs/1912.07203 (2019) - 2018
- [j202]David Gajser, Bojan Mohar:
Minimal Normal Graph Covers. Comb. 38(6): 1415-1436 (2018) - [j201]Seyyed Aliasghar Hosseini, Bojan Mohar:
Game of cops and robbers in oriented quotients of the integer grid. Discret. Math. 341(2): 439-450 (2018) - [j200]Michal Kotrbcík, Naoki Matsumoto, Bojan Mohar, Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki, Andrej Vodopivec:
Grünbaum colorings of even triangulations on surfaces. J. Graph Theory 87(4): 475-491 (2018) - [j199]Frédéric Havet, Ana Karolinna Maia, Bojan Mohar:
Finding a subdivision of a prescribed digraph of order 4. J. Graph Theory 87(4): 536-560 (2018) - [j198]Carlos A. Alfaro, Alan Arroyo, Marek Dernár, Bojan Mohar:
The Crossing Number of the Cone of a Graph. SIAM J. Discret. Math. 32(3): 2080-2093 (2018) - [j197]Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Dan McQuillan, Bojan Mohar, Petra Mutzel, Pedro Ramos, R. Bruce Richter, Birgit Vogtenhuber:
Bishellable drawings of Kn. SIAM J. Discret. Math. 32(4): 2482-2492 (2018) - [c29]Éric Colin de Verdière, Thomas Magnard, Bojan Mohar:
Embedding Graphs into Two-Dimensional Simplicial Complexes. SoCG 2018: 27:1-27:14 - [c28]Zdenek Dvorák, Petr Hlinený, Bojan Mohar:
Structure and Generation of Crossing-Critical Graphs. SoCG 2018: 33:1-33:14 - [c27]Bojan Mohar, Yifan Jing:
Efficient Polynomial-Time Approximation Scheme for the Genus of Dense Graphs. FOCS 2018: 719-730 - [c26]Ross Churchley, Bojan Mohar:
A submodular measure and approximate Gomory-Hu theorem for packing odd trails. SODA 2018: 210-218 - [i15]Zdenek Dvorák, Petr Hlinený, Bojan Mohar:
Structure and generation of crossing-critical graphs. CoRR abs/1803.01931 (2018) - [i14]Éric Colin de Verdière, Thomas Magnard, Bojan Mohar:
Embedding graphs into two-dimensional simplicial complexes. CoRR abs/1803.07032 (2018) - [i13]Matt DeVos, Sebastián González Hermosillo de la Maza, Krystal Guo, Daryl Funk, Tony Huynh, Bojan Mohar, Amanda Montejano:
Short rainbow cycles in sparse graphs. CoRR abs/1806.00825 (2018) - [i12]Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood:
Tight Upper Bounds on the Crossing Number in a Minor-Closed Class. CoRR abs/1807.11617 (2018) - [i11]Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés:
The inverse Voronoi problem in graphs. CoRR abs/1811.12547 (2018) - 2017
- [j196]Dan Archdeacon, Matt DeVos, Stefan Hannie, Bojan Mohar:
Whitney's theorem for 2-regular planar digraphs. Australas. J Comb. 67: 159-165 (2017) - [j195]Dan Archdeacon, C. Paul Bonnington, Bojan Mohar:
Embedding quartic Eulerian digraphs on the plane. Australas. J Comb. 67: 364-377 (2017) - [j194]Drago Bokal, Bojan Mohar, Jozef Sirán:
Dan Archdeacon (11 May 1954 to 18 February 2015). Ars Math. Contemp. 12(1) (2017) - [j193]Seyed Saeed Changiz Rezaei, Seyyed Aliasghar Hosseini, Bojan Mohar:
Almost all regular graphs are normal. Discret. Appl. Math. 230: 51-55 (2017) - [j192]Krystal Guo, Bojan Mohar:
Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths. Discret. Math. 340(11): 2616-2632 (2017) - [j191]Bojan Mohar, Petr Skoda:
Obstructions for two-vertex alternating embeddings of graphs in surfaces. Eur. J. Comb. 59: 96-113 (2017) - [j190]Zdenek Dvorák, Bojan Mohar, Robert Sámal:
Exponentially many nowhere-zero ℝ3-, ℝ4-, and ℝ6-flows. Electron. Notes Discret. Math. 61: 375-381 (2017) - [j189]Fiachra Knox, Naoki Matsumoto, Sebastián González Hermosillo de la Maza, Bojan Mohar, Cláudia Linhares Sales:
Proper Orientations of Planar Bipartite Graphs. Graphs Comb. 33(5): 1189-1194 (2017) - [j188]Zdenek Dvorák, Bernard Lidický, Bojan Mohar, Luke Postle:
5-list-coloring planar graphs with distant precolored vertices. J. Comb. Theory B 122: 311-352 (2017) - [j187]Zdenek Dvorák, Bernard Lidický, Bojan Mohar:
5-choosability of graphs with crossings far apart. J. Comb. Theory B 123: 54-96 (2017) - [j186]Ararat Harutyunyan, Bojan Mohar:
Planar Digraphs of Digirth Five Are 2-Colorable. J. Graph Theory 84(4): 408-427 (2017) - [j185]Krystal Guo, Bojan Mohar:
Hermitian Adjacency Matrix of Digraphs and Mixed Graphs. J. Graph Theory 85(1): 217-248 (2017) - [j184]Zhentao Li, Bojan Mohar:
Planar Digraphs of Digirth Four are 2-Colorable. SIAM J. Discret. Math. 31(3): 2201-2205 (2017) - [c25]Zdenek Dvorák, Daniel Král, Bojan Mohar:
Graphic TSP in Cubic Graphs. STACS 2017: 27:1-27:13 - [i10]Anthony Bonato, Bojan Mohar:
Topological directions in Cops and Robbers. CoRR abs/1709.09050 (2017) - 2016
- [j183]Bojan Mohar:
Median Eigenvalues of Bipartite Subcubic Graphs. Comb. Probab. Comput. 25(5): 768-790 (2016) - [j182]Michael Krivelevich, Bojan Mohar:
Editorial. J. Comb. Theory B 121: 1 (2016) - [j181]Bojan Mohar, Arash Rafiey, Behruz Tayfeh-Rezaie, Hehui Wu:
Interval Minors of Complete Bipartite Graphs. J. Graph Theory 82(3): 312-321 (2016) - [j180]Zdenek Dvorák, Bojan Mohar:
Crossing Numbers of Periodic Graphs. J. Graph Theory 83(1): 34-43 (2016) - [c24]Carlos A. Alfaro, Alan Arroyo, Marek Dernár, Bojan Mohar:
The Crossing Number of the Cone of a Graph. GD 2016: 427-438 - [c23]Ross Churchley, Bojan Mohar, Hehui Wu:
Weak duality for packing edge-disjoint odd (u, v)-trails. SODA 2016: 2086-2094 - [i9]Zhentao Li, Bojan Mohar:
Planar digraphs of digirth four are 2-colourable. CoRR abs/1606.06114 (2016) - [i8]Zdenek Dvorák, Daniel Král, Bojan Mohar:
Graphic TSP in cubic graphs. CoRR abs/1608.07568 (2016) - 2015
- [j179]Matt DeVos, Bojan Mohar, Robert Sámal:
Highly arc-transitive digraphs - Structure and counterexamples. Comb. 35(5): 553-571 (2015) - [j178]Bojan Mohar:
Corrigendum to "Many large eigenvalues in sparse graphs" [European J. Combin. 34(2013) 1125-1129]. Eur. J. Comb. 47: 141-143 (2015) - [j177]Bojan Mohar, Hehui Wu:
Triangle-free subgraphs with large fractional chromatic number. Electron. Notes Discret. Math. 49: 661-666 (2015) - [j176]Sergio Cabello, Bojan Mohar, Robert Sámal:
Drawing a disconnected graph on the torus (Extended abstract). Electron. Notes Discret. Math. 49: 779-786 (2015) - [j175]Bojan Mohar:
Median eigenvalues and the HOMO-LUMO index of graphs. J. Comb. Theory B 112: 78-92 (2015) - [c22]Lino Demasi, Bojan Mohar:
Four terminal planar Delta-Wye reducibility via rooted K2, 4 minors. SODA 2015: 1728-1742 - [i7]Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Dan McQuillan, Bojan Mohar, Petra Mutzel, Pedro Ramos, R. Bruce Richter, Birgit Vogtenhuber:
Bishellable drawings of Kn. CoRR abs/1510.00549 (2015) - 2014
- [j174]Matt DeVos, Zdenek Dvorák, Jacob Fox, Jessica McDonald, Bojan Mohar, Diego Scheide:
A minimum degree condition forcing complete graph immersion. Comb. 34(3): 279-298 (2014) - [j173]Guillaume Chapuy, Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide:
Packing Triangles in Weighted Graphs. SIAM J. Discret. Math. 28(1): 226-239 (2014) - [j172]Azhvan Sheikh Ahmady, Jason P. Bell, Bojan Mohar:
Integral Cayley Graphs and Groups. SIAM J. Discret. Math. 28(2): 685-701 (2014) - [j171]Roi Krakovski, Bojan Mohar:
Homological Face-Width Condition Forcing K6-Minors in Graphs on Surfaces. SIAM J. Discret. Math. 28(3): 1257-1275 (2014) - [c21]Pavol Hell, Bojan Mohar, Arash Rafiey:
Ordering without Forbidden Patterns. ESA 2014: 554-565 - [i6]Bojan Mohar, Arash Rafiey, Behruz Tayfeh-Rezaie, Hehui Wu:
Interval minors of complete bipartite graphs. CoRR abs/1408.1155 (2014) - [i5]Pavol Hell, Bojan Mohar, Arash Rafiey:
Ordering without forbidden patterns. CoRR abs/1408.1461 (2014) - 2013
- [j170]Bojan Mohar:
The excluded minor structure theorem with planarly embedded wall. Ars Math. Contemp. 6(2): 187-196 (2013) - [j169]Bojan Mohar, Gábor Simonyi, Gábor Tardos:
Local chromatic number of quadrangulations of surfaces. Comb. 33(4): 467-495 (2013) - [j168]Zdenek Dvorák, Bojan Mohar:
Chromatic number and complete graph substructures for degree sequences. Comb. 33(5): 513-529 (2013) - [j167]Matt DeVos, Roi Krakovski, Bojan Mohar, Azhvan Sheikh Ahmady:
Integral Cayley Multigraphs over Abelian and Hamiltonian Groups. Electron. J. Comb. 20(2): 63 (2013) - [j166]Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide:
A Note on Forbidding Clique Immersions. Electron. J. Comb. 20(3): 55 (2013) - [j165]Bojan Mohar:
Many large eigenvalues in sparse graphs. Eur. J. Comb. 34(7): 1125-1129 (2013) - [j164]Vladimir P. Korzhik, Bojan Mohar:
Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing. J. Graph Theory 72(1): 30-71 (2013) - [j163]Zdenek Dvorák, Bojan Mohar, Robert Sámal:
Star Chromatic Index. J. Graph Theory 72(3): 313-326 (2013) - [j162]Sergio Cabello, Bojan Mohar:
Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard. SIAM J. Comput. 42(5): 1803-1829 (2013) - [j161]Peter Keevash, Zhentao Li, Bojan Mohar, Bruce A. Reed:
Digraph Girth via Chromatic Number. SIAM J. Discret. Math. 27(2): 693-696 (2013) - 2012
- [j160]Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar:
Linkless and Flat Embeddings in 3-Space. Discret. Comput. Geom. 47(4): 731-755 (2012) - [j159]Ararat Harutyunyan, Bojan Mohar:
Two results on the digraph chromatic number. Discret. Math. 312(10): 1823-1826 (2012) - [j158]Bojan Mohar, Simon Spacapan:
Degenerate and star colorings of graphs on surfaces. Eur. J. Comb. 33(3): 340-349 (2012) - [j157]Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide:
Immersing complete digraphs. Eur. J. Comb. 33(6): 1294-1302 (2012) - [j156]Daniel Král', Bojan Mohar, Atsuhiro Nakamoto, Ondrej Pangrác, Yusuke Suzuki:
Coloring Eulerian Triangulations of the Klein Bottle. Graphs Comb. 28(4): 499-530 (2012) - [j155]Zdenek Dvorák, Bojan Mohar:
Spectrally degenerate graphs: Hereditary case. J. Comb. Theory B 102(5): 1099-1109 (2012) - [j154]Bojan Mohar, Petr Skoda:
Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph. J. Graph Algorithms Appl. 16(2): 225-241 (2012) - [j153]Jessica McDonald, Bojan Mohar, Diego Scheide:
Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs. J. Graph Theory 70(2): 226-239 (2012) - [j152]Ararat Harutyunyan, Bojan Mohar:
Planar Graphs Have Exponentially Many 3-Arboricities. SIAM J. Discret. Math. 26(3): 1269-1280 (2012) - [i4]Sergio Cabello, Bojan Mohar:
Adding one edge to planar graphs makes crossing number and 1-planarity hard. CoRR abs/1203.5944 (2012) - [i3]Zdenek Dvorák, Bernard Lidický, Bojan Mohar, Luke Postle:
5-list-coloring planar graphs with distant precolored vertices. CoRR abs/1209.0366 (2012) - 2011
- [j151]Sergio Cabello, Bojan Mohar:
Crossing Number and Weighted Crossing Number of Near-Planar Graphs. Algorithmica 60(3): 484-504 (2011) - [j150]Guantao Chen, Yoshimi Egawa, Ken-ichi Kawarabayashi, Bojan Mohar, Katsuhiro Ota:
Toughness of Ka,t-Minor-Free Graphs. Electron. J. Comb. 18(1) (2011) - [j149]Ararat Harutyunyan, Bojan Mohar:
Strengthened Brooks' Theorem for Digraphs of Girth at least Three. Electron. J. Comb. 18(1) (2011) - [j148]Gena Hahn, Bojan Mohar:
Preface. Discret. Math. 311(15): 1389 (2011) - [j147]Bojan Mohar, Tamon Stephen:
Expected Crossing Numbers. Electron. Notes Discret. Math. 38: 651-656 (2011) - [j146]Matt DeVos, Bojan Mohar, Robert Sámal:
Unexpected behaviour of crossing sequences. J. Comb. Theory B 101(6): 448-463 (2011) - [j145]Guillaume Chapuy, Éric Fusy, Omer Giménez, Bojan Mohar, Marc Noy:
Asymptotic enumeration and limit laws for graphs of fixed genus. J. Comb. Theory A 118(3): 748-777 (2011) - [j144]Bojan Mohar, Andrej Vodopivec:
The genus of Petersen powers. J. Graph Theory 67(1): 1-8 (2011) - [j143]Ararat Harutyunyan, Bojan Mohar:
Gallai's Theorem for List Coloring of Digraphs. SIAM J. Discret. Math. 25(1): 170-180 (2011) - [c20]Bojan Mohar, Petr Skoda:
On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph. IWOCA 2011: 300-309 - 2010
- [j142]Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar, Haruko Okamura:
Immersing small complete graphs. Ars Math. Contemp. 3(2): 139-146 (2010) - [j141]Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar:
Approximation algorithms via contraction decomposition. Comb. 30(5): 533-552 (2010) - [j140]Bojan Mohar, Igor Rivin:
Simplices and Spectra of Graphs. Discret. Comput. Geom. 43(3): 516-521 (2010) - [j139]Matt DeVos, Agelos Georgakopoulos, Bojan Mohar, Robert Sámal:
An Eberhard-Like Theorem for Pentagons and Heptagons. Discret. Comput. Geom. 44(4): 931-945 (2010) - [j138]Sandi Klavzar, Dragan Marusic, Bojan Mohar, Tomaz Pisanski:
Preface. Discret. Math. 310(12): 1651-1652 (2010) - [j137]Bojan Mohar:
Strong embeddings of minimum genus. Discret. Math. 310(20): 2595-2599 (2010) - [j136]Gasper Fijavz, Bojan Mohar:
Rigidity and Separation Indices of Graphs in Surfaces. Graphs Comb. 26(4): 491-498 (2010) - [j135]Zdenek Dvorák, Bojan Mohar:
Crossing-critical graphs with large maximum degree. J. Comb. Theory B 100(4): 413-417 (2010) - [j134]Zdenek Dvorák, Bojan Mohar:
Spectral radius of finite and infinite planar graphs and of graphs of bounded genus. J. Comb. Theory B 100(6): 729-739 (2010) - [j133]Ken-ichi Kawarabayashi, Bojan Mohar:
Star Coloring and Acyclic Coloring of Locally Planar Graphs. SIAM J. Discret. Math. 24(1): 56-71 (2010) - [j132]Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar:
Finding one tight cycle. ACM Trans. Algorithms 6(4): 61:1-61:13 (2010) - [c19]Sergio Cabello, Bojan Mohar:
Adding one edge to planar graphs makes crossing number hard. SCG 2010: 68-76 - [c18]Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar:
Linkless and flat embeddings in 3-space and the unknot problem. SCG 2010: 97-106 - [c17]Bojan Mohar:
Do We Really Understand the Crossing Numbers? MFCS 2010: 38-41 - [i2]Zdenek Dvorák, Bojan Mohar:
Spectrally degenerate graphs: Hereditary case. CoRR abs/1010.3367 (2010)
2000 – 2009
- 2009
- [j131]Bojan Mohar:
The genus crossing number. Ars Math. Contemp. 2(2): 157-162 (2009) - [j130]Zdenek Dvorák, Bojan Mohar:
Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (extended abstract). Electron. Notes Discret. Math. 34: 101-105 (2009) - [j129]Bojan Mohar:
On the sum of k largest eigenvalues of graphs and symmetric matrices. J. Comb. Theory B 99(2): 306-313 (2009) - [j128]Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar:
Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)]. J. Comb. Theory B 99(2): 323 (2009) - [j127]Matt DeVos, Luis A. Goddyn, Bojan Mohar, Robert Sámal:
Cayley sum graphs and eigenvalues of (3, 6)-fullerenes. J. Comb. Theory B 99(2): 358-369 (2009) - [j126]Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar:
Linear connectivity forces large complete bipartite minors. J. Comb. Theory B 99(3): 557-582 (2009) - [j125]Hal A. Kierstead, Bojan Mohar, Simon Spacapan, Daqing Yang, Xuding Zhu:
The Two-Coloring Number and Degenerate Colorings of Planar Graphs. SIAM J. Discret. Math. 23(3): 1548-1560 (2009) - [c16]Ken-ichi Kawarabayashi, Bojan Mohar:
List-color-critical graphs on a fixed surface. SODA 2009: 1156-1165 - 2008
- [j124]Bojan Mohar, Eckhard Steffen, Andrej Vodopivec:
Relating embedding and coloring properties of snarks. Ars Math. Contemp. 1(2): 169-184 (2008) - [j123]Matt DeVos, Bojan Mohar, Robert Sámal:
Unexpected behaviour of crossing sequences. Electron. Notes Discret. Math. 31: 259-264 (2008) - [j122]Bojan Mohar, Simon Spacapan:
Coloring parameters for graphs on surfaces. Electron. Notes Discret. Math. 31: 281-286 (2008) - [j121]Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar:
Locally planar graphs are 5-choosable. J. Comb. Theory B 98(6): 1215-1232 (2008) - [c15]Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood:
Improved upper bounds on the crossing number. SCG 2008: 375-384 - [c14]Ken-ichi Kawarabayashi, Bojan Mohar, Bruce A. Reed:
A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width. FOCS 2008: 771-780 - [c13]Sergio Cabello, Bojan Mohar:
Crossing and Weighted Crossing Number of Near-Planar Graphs. GD 2008: 38-49 - [c12]Vladimir P. Korzhik, Bojan Mohar:
Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing. GD 2008: 302-312 - [c11]Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar:
Finding one tight cycle. SODA 2008: 527-531 - [c10]Ken-ichi Kawarabayashi, Bojan Mohar:
Graph and map isomorphism and all polyhedral embeddings in linear time. STOC 2008: 471-480 - 2007
- [j120]Martin Juvan, Joze Marincek, Bojan Mohar:
Obstructions for simple embeddings. Australas. J Comb. 38: 3-26 (2007) - [j119]Sergio Cabello, Bojan Mohar:
Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs. Discret. Comput. Geom. 37(2): 213-235 (2007) - [j118]Sandi Klavzar, Dragan Marusic, Bojan Mohar, Tomaz Pisanski:
Preface. Discret. Math. 307(3-5): 299 (2007) - [j117]Janez Ales, Bojan Mohar, Tomaz Pisanski:
Heuristic search for Hamilton cycles in cubic graphs. Discret. Math. 307(3-5): 303-309 (2007) - [j116]Bojan Mohar, Richard J. Nowakowski, Douglas B. West:
Research problems from the 5th Slovenian Conference (Bled, 2003). Discret. Math. 307(3-5): 650-658 (2007) - [j115]Peter Bella, Daniel Král, Bojan Mohar, Katarína Quittnerová:
Labeling planar graphs with a condition at distance two. Eur. J. Comb. 28(8): 2201-2239 (2007) - [j114]Ken-ichi Kawarabayashi, Bojan Mohar:
Some Recent Progress and Applications in Graph Minor Theory. Graphs Comb. 23(1): 1-46 (2007) - [j113]Ken-ichi Kawarabayashi, Bojan Mohar:
A relaxed Hadwiger's Conjecture for list colorings. J. Comb. Theory B 97(4): 647-651 (2007) - [j112]Matt DeVos, Javad B. Ebrahimi, Mohammad Ghebleh, Luis A. Goddyn, Bojan Mohar, Reza Naserasr:
Circular Coloring the Plane. SIAM J. Discret. Math. 21(2): 461-465 (2007) - [c9]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Bojan Mohar:
Approximation algorithms via contraction decomposition. SODA 2007: 278-287 - 2006
- [j111]Bojan Mohar:
Universal obstructions for embedding extension problems. Australas. J Comb. 36: 39-68 (2006) - [j110]Bojan Mohar, Andrej Vodopivec:
On Polyhedral Embeddings of Cubic Graphs. Comb. Probab. Comput. 15(6): 877-893 (2006) - [j109]Bojan Mohar:
Graphs on Surfaces and Their Applications, by Sergei K. Lando and Alexander K. Zvonkin, Encyclopaedia of Mathematical Sciences 141, Springer-Verlag, 2004. Comb. Probab. Comput. 15(6): 939-941 (2006) - [j108]Bojan Mohar:
Bar-Magnet Polyhedra and NS-Orientations of Maps. Discret. Comput. Geom. 35(3): 481-491 (2006) - [j107]Matt DeVos, Bojan Mohar:
Small separations in vertex-transitive graphs. Electron. Notes Discret. Math. 24: 165-172 (2006) - [j106]Michael O. Albertson, Bojan Mohar:
Coloring Vertices and Faces of Locally Planar Graphs. Graphs Comb. 22(3): 289-295 (2006) - [j105]Sergio Cabello, Matt DeVos, Bojan Mohar:
Expected Case for Projecting Points. Informatica (Slovenia) 30(3): 289-293 (2006) - [j104]Bojan Mohar:
On the Crossing Number of Almost Planar Graphs. Informatica (Slovenia) 30(3): 301-303 (2006) - [j103]Bojan Mohar:
Tree amalgamation of graphs and tessellations of the Cantor sphere. J. Comb. Theory B 96(5): 740-753 (2006) - [j102]Drago Bokal, Gasper Fijavz, Bojan Mohar:
The Minor Crossing Number. SIAM J. Discret. Math. 20(2): 344-356 (2006) - [c8]Ken-ichi Kawarabayashi, Bojan Mohar:
Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. STOC 2006: 401-416 - 2005
- [j101]Bojan Mohar:
Triangulations and the Hajós Conjecture. Electron. J. Comb. 12 (2005) - [j100]Bojan Mohar:
Foreword. Eur. J. Comb. 26(3-4): 287-288 (2005) - [j99]Martin Juvan, Bojan Mohar:
2-restricted extensions of partial embeddings of graphs. Eur. J. Comb. 26(3-4): 339-375 (2005) - [j98]Bojan Mohar:
Acyclic colorings of locally planar graphs. Eur. J. Comb. 26(3-4): 491-503 (2005) - [j97]Sandi Klavzar, Bojan Mohar:
Crossing numbers of Sierpinski-like graphs. J. Graph Theory 50(3): 186-198 (2005) - [c7]Sergio Cabello, Bojan Mohar:
Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs. ESA 2005: 131-142 - [i1]Sergio Cabello, Bojan Mohar, Arjana Zitnik:
Homotopic spanners. EuroCG 2005: 25-28 - 2004
- [j96]Bojan Mohar:
Hajós Theorem For Colorings Of Edge-Weighted Graphs. Comb. 25(1): 65-76 (2004) - [j95]Gasper Fijavz, Bojan Mohar:
Rigidity and separation indices of Paley graphs. Discret. Math. 289(1-3): 157-161 (2004) - [j94]Bostjan Bresar, Sandi Klavzar, Alenka Lipovec, Bojan Mohar:
Cubic inflation, mirror graphs, regular maps, and partial cubes. Eur. J. Comb. 25(1): 54-64 (2004) - [j93]Bojan Mohar:
Foreword. Eur. J. Comb. 25(6): 761-762 (2004) - [j92]Drago Bokal, Martin Juvan, Bojan Mohar:
A Spectral Approach to Graphical Representation of Data. Informatica (Slovenia) 28(3): 233-238 (2004) - [j91]Thomas Böhme, Bojan Mohar, Riste Skrekovski, Michael Stiebitz:
Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs. J. Graph Theory 45(4): 270-274 (2004) - [j90]Drago Bokal, Gasper Fijavz, Martin Juvan, P. Mark Kayll, Bojan Mohar:
The circular chromatic number of a digraph. J. Graph Theory 46(3): 227-240 (2004) - 2003
- [j89]Gasper Fijavz, Bojan Mohar:
K6-Minors in Projective Planar Graphs. Comb. 23(3): 453-465 (2003) - [j88]Thomas Böhme, Bojan Mohar:
Domination, Packing and Excluded Minors. Electron. J. Comb. 10 (2003) - [j87]Sylvain Gravier, Frédéric Maffray, Bojan Mohar:
On a list-coloring problem. Discret. Math. 268(1-3): 303-308 (2003) - [j86]Sandi Klavzar, Bojan Mohar, Tomaz Pisanski, Norbert Seifter, Janez Zerovnik:
Preface. Discuss. Math. Graph Theory 23(2): 205 (2003) - [j85]Scott Jones, P. Mark Kayll, Bojan Mohar, Walter D. Wallis:
On constant-weight TSP-tours. Discuss. Math. Graph Theory 23(2): 287-307 (2003) - [j84]Bojan Mohar, Alexander Schrijver:
Blocking nonorientability of a surface. J. Comb. Theory B 87(1): 2-16 (2003) - [j83]Bojan Mohar:
Circular colorings of edge-weighted graphs. J. Graph Theory 43(2): 107-116 (2003) - [j82]Bojan Mohar, Riste Skrekovski, Heinz-Jürgen Voss:
Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9. J. Graph Theory 44(4): 261-295 (2003) - [j81]Tomás Feder, Pavol Hell, Bojan Mohar:
Acyclic Homomorphisms and Circular Colorings of Digraphs. SIAM J. Discret. Math. 17(1): 161-169 (2003) - 2002
- [j80]Noga Alon, Bojan Mohar:
The Chromatic Number Of Graph Powers. Comb. Probab. Comput. 11(1): 1-10 (2002) - [j79]Sandi Klavzar, Dragan Marusic, Bojan Mohar:
Preface. Discret. Math. 244(1-3): 1-4 (2002) - [j78]Joze Marincek, Bojan Mohar:
On approximating the maximum diameter ratio of graphs. Discret. Math. 244(1-3): 323-330 (2002) - [j77]Bojan Mohar:
Coloring Eulerian triangulations of the projective plane. Discret. Math. 244(1-3): 339-343 (2002) - [j76]Gasper Fijavz, Martin Juvan, Bojan Mohar, Riste Skrekovski:
Planar Graphs Without Cycles of Specific Lengths. Eur. J. Comb. 23(4): 377-388 (2002) - [j75]Thomas Böhme, Bojan Mohar:
Labeled K2, t Minors in Plane Graphs. J. Comb. Theory B 84(2): 291-300 (2002) - [j74]Bojan Mohar, Paul D. Seymour:
Coloring Locally Bipartite Graphs on Surfaces. J. Comb. Theory B 84(2): 301-310 (2002) - [j73]Thomas Böhme, Bojan Mohar, Carsten Thomassen:
Long Cycles in Graphs on a Fixed Surface. J. Comb. Theory B 85(2): 338-347 (2002) - [j72]Thomas Böhme, John Maharry, Bojan Mohar:
Ka, k Minors in Graphs of Bounded Tree-Width. J. Comb. Theory B 86(1): 133-147 (2002) - 2001
- [b1]Bojan Mohar, Carsten Thomassen:
Graphs on Surfaces. Johns Hopkins series in the mathematical sciences, Johns Hopkins University Press 2001, ISBN 978-0-8018-6689-0, pp. I-XI, 1-291 - [j71]Bojan Mohar:
Existence of Polyhedral Embeddings of Graphs. Comb. 21(3): 395-401 (2001) - [j70]Bojan Mohar, Riste Skrekovski:
Nowhere-zero k-flows of Supergraphs. Electron. J. Comb. 8(1) (2001) - [j69]Simone Dantas, Sylvain Gravier, Frédéric Maffray, Bojan Mohar:
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum. Electron. Notes Discret. Math. 7: 22-25 (2001) - [j68]Bojan Mohar:
Face Covers and the Genus Problem for Apex Graphs. J. Comb. Theory B 82(1): 102-117 (2001) - [j67]Bojan Mohar, Neil Robertson:
Flexibility of Polyhedral Embeddings of Graphs in Surfaces. J. Comb. Theory B 83(1): 38-57 (2001) - 2000
- [j66]Bojan Mohar:
Some Topological Methods in Graph Coloring Theory. Electron. Notes Discret. Math. 5: 231-234 (2000) - [j65]Bojan Mohar:
Light paths in 4-connected graphs in the plane and other surfaces. J. Graph Theory 34(2): 170-179 (2000)
1990 – 1999
- 1999
- [j64]Martin Juvan, Bojan Mohar, Robin Thomas:
List Edge-Colorings of Series-Parallel Graphs. Electron. J. Comb. 6 (1999) - [j63]Bojan Mohar, Riste Skrekovski:
The Grötzsch Theorem for the Hypergraph of Maximal Cliques. Electron. J. Comb. 6 (1999) - [j62]Martin Juvan, Bojan Mohar, Riste Skrekovski:
Graphs of degree 4 are 5-edge-choosable. J. Graph Theory 32(3): 250-264 (1999) - [j61]Thomas Böhme, Bojan Mohar, Michael Stiebitz:
Dirac's map-color theorem for choosability. J. Graph Theory 32(4): 327-339 (1999) - [j60]Bojan Mohar:
A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface. SIAM J. Discret. Math. 12(1): 6-26 (1999) - [c6]Bojan Mohar:
Drawing Graphs in the Hyperbolic Plane. GD 1999: 127-136 - 1998
- [j59]Dan Archdeacon, Nora Hartsfield, C. H. C. Little, Bojan Mohar:
Obstruction Sets for Outer-Projective-Planar Graphs. Ars Comb. 49 (1998) - [j58]Martin Juvan, Bojan Mohar, Riste Skrekovski:
List Total Colourings of Graphs. Comb. Probab. Comput. 7(2): 181-188 (1998) - [j57]Bojan Mohar, Pierre Rosenstiehl:
Tessellation and Visibility Representations of Maps on the Torus. Discret. Comput. Geom. 19(2): 249-263 (1998) - [j56]Dragan Marusic, Bojan Mohar:
Preface. Discret. Math. 182(1-3): 1 (1998) - [j55]Bojan Mohar:
On the orientable genus of graphs with bounded nonorientable genus. Discret. Math. 182(1-3): 245-253 (1998) - [j54]Diego Klabjan, Bojan Mohar:
The number of matchings of low order in hexagonal systems. Discret. Math. 186(1-3): 167-175 (1998) - [j53]Martin Juvan, Bojan Mohar, Riste Skrekovski:
On list edge-colorings of subcubic graphs. Discret. Math. 187(1-3): 137-149 (1998) - 1997
- [j52]Bojan Mohar:
Projective Plane and Möbius Band Obstructions. Comb. 17(2): 235-266 (1997) - [j51]Martin Juvan, Bojan Mohar, Janez Zerovnik:
Distance-related Invariants on Polygraphs. Discret. Appl. Math. 80(1): 57-71 (1997) - [j50]Bojan Mohar:
Apex graphs with embeddings of face-width three. Discret. Math. 176(1-3): 203-210 (1997) - [j49]Bojan Mohar:
Circle Packings of Maps in Polynomial Time. Eur. J. Comb. 18(7): 785-805 (1997) - [j48]Bojan Mohar:
On the minimal genus of 2-complexes. J. Graph Theory 24(3): 281-290 (1997) - [j47]Martin Juvan, Bojan Mohar:
Obstructions For 2-Möbius Band Embedding Extension Problem. SIAM J. Discret. Math. 10(1): 57-72 (1997) - 1996
- [j46]Bojan Mohar, Neil Robertson, Richard P. Vitray:
Planar graphs on the projective plane. Discret. Math. 149(1-3): 141-157 (1996) - [j45]Bojan Mohar:
Straight-line representations of maps on the torus and other flat surfaces. Discret. Math. 155(1-3): 173-181 (1996) - [j44]Ivan Gutman, Bojan Mohar:
The Quasi-Wiener and the Kirchhoff Indices Coincide. J. Chem. Inf. Comput. Sci. 36(5): 982-985 (1996) - [j43]Richard Brunet, Bojan Mohar, R. Bruce Richter:
Separating and Nonseparating Disjoint Homotopic Cycles in Graph Embeddings. J. Comb. Theory B 66(2): 201-231 (1996) - [j42]Martin Juvan, Aleksander Malnic, Bojan Mohar:
Systems of Curves on Surfaces. J. Comb. Theory, Ser. B 68(1): 7-22 (1996) - [j41]Bojan Mohar, Neil Robertson:
Planar Graphs on Nonplanar Surfaces. J. Comb. Theory, Ser. B 68(1): 87-111 (1996) - [j40]Bojan Mohar, Neil Robertson:
Disjoint Essential Cycles. J. Comb. Theory, Ser. B 68(2): 324-349 (1996) - [c5]Bojan Mohar:
Embedding Graphs in an Arbitrary Surface in Linear Time. STOC 1996: 392-397 - 1995
- [j39]Bojan Mohar:
Uniqueness and Minimality of Large Face-Width Embeddings of Graphs. Comb. 15(4): 541-556 (1995) - [j38]Sandi Klavzar, Bojan Mohar:
The chromatic numbers of graph bundles over cycles. Discret. Math. 138(1-3): 301-314 (1995) - [j37]Martin Juvan, Bojan Mohar:
Bond Contributions to the Wiener Index. J. Chem. Inf. Comput. Sci. 35(2): 217-219 (1995) - [j36]Sandi Klavzar, Ivan Gutman, Bojan Mohar:
Labeling of Benzenoid Systems which Reflects the Vertex-Distance Relations. J. Chem. Inf. Comput. Sci. 35(3): 590-593 (1995) - [j35]Martin Juvan, Bojan Mohar, Ante Graovac, Sandi Klavzar, Janez Zerovnik:
Fast computation of the Wiener index of fasciagraphs and rotagraphs. J. Chem. Inf. Comput. Sci. 35(5): 834-840 (1995) - [j34]Sandi Klavzar, Bojan Mohar:
Coloring graph bundles. J. Graph Theory 19(2): 145-155 (1995) - [c4]Martin Juvan, Joze Marincek, Bojan Mohar:
Embedding Graphs in the Torus in Linear Time. IPCO 1995: 360-363 - 1994
- [j33]Bojan Mohar:
Obstructions for the Disk and the Cylinder Embedding Extension Problems. Comb. Probab. Comput. 3: 375-406 (1994) - [j32]Bojan Mohar:
Convex Representations of Maps on the Torus and Other Flat Surfaces. Discret. Comput. Geom. 11: 83-95 (1994) - [j31]Vladimir Batagelj, Dragan Marusic, Bojan Mohar, Tomaz Pisanski:
Preface. Discret. Math. 134(1-3): 1 (1994) - [j30]Steve Fisk, Bojan Mohar:
Surface triangulations with isometric boundary. Discret. Math. 134(1-3): 49-62 (1994) - [j29]Bojan Mohar:
Extremal Mono-q-polyhexes. J. Chem. Inf. Comput. Sci. 34(5): 1127-1129 (1994) - [j28]Steve Fisk, Bojan Mohar:
Coloring Graphs without Short Non-bounding Cycles. J. Comb. Theory B 60(2): 268-276 (1994) - [c3]Bojan Mohar, Pierre Rosenstiehl:
A Flow Approach to Upward Drawings of Toroidal Maps. GD 1994: 33-39 - 1993
- [j27]Bojan Mohar:
7-critical graphs of bounded genus. Discret. Math. 112(1-3): 279-281 (1993) - [j26]Bojan Mohar:
A polynomial time circle packing algorithm. Discret. Math. 117(1-3): 257-263 (1993) - [j25]Bojan Mohar:
Projective Planarity in Linear Time. J. Algorithms 15(3): 482-502 (1993) - [j24]Bojan Mohar, Darko Babic, Nenad Trinajstic:
A novel definition of the Wiener index for trees. J. Chem. Inf. Comput. Sci. 33(1): 153-154 (1993) - [j23]Martin Juvan, Bojan Mohar:
Laplace eigenvalues and bandwidth-type invariants of graphs. J. Graph Theory 17(3): 393-407 (1993) - [j22]Bojan Mohar:
Circle packing representation in the plane and other surfaces. SIGACT News 24(1): 59 (1993) - [c2]Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl:
A spectral approach to bandwidth and separator problems in graphs. IPCO 1993: 183-194 - 1992
- [j21]Martin Juvan, Bojan Mohar:
Optimal linear labelings and eigenvalues of graphs. Discret. Appl. Math. 36(2): 153-168 (1992) - [j20]Bojan Mohar:
A domain monotonicity theorem for graphs and Hamiltonicity. Discret. Appl. Math. 36(2): 169-177 (1992) - [j19]Bojan Mohar:
Laplace eigenvalues of graphs - a survey. Discret. Math. 109(1-3): 171-183 (1992) - [j18]Aleksander Malnic, Bojan Mohar:
Generating locally cyclic triangulations of surfaces. J. Comb. Theory B 56(2): 147-164 (1992) - 1991
- [j17]Bojan Mohar:
Some relations between analytic and geometric properties of infinite graphs. Discret. Math. 95(1-3): 193-219 (1991) - [j16]Bojan Mohar:
Eigenvalues, diameter, and mean distance in graphs. Graphs Comb. 7(1): 53-64 (1991) - [c1]Bojan Mohar, Neil Robertson:
Disjoint Essential Circuits in Toroidal Maps. Planar Graphs 1991: 109-130 - 1990
- [j15]Bojan Mohar, Tomaz Pisanski, Arthur T. White:
Embeddings of cartesian products of nearly bipartite graphs. J. Graph Theory 14(3): 301-310 (1990)
1980 – 1989
- 1989
- [j14]Bojan Mohar:
An obstruction to embedding graphs in surfaces. Discret. Math. 78(1-2): 135-142 (1989) - [j13]Bojan Mohar:
Isoperimetric numbers of graphs. J. Comb. Theory B 47(3): 274-291 (1989) - 1988
- [j12]Bojan Mohar:
Nonorientable Genus of Nearly Complete Bipartite Graphs. Discret. Comput. Geom. 3: 137-146 (1988) - [j11]Bojan Mohar:
Branced Covering. Discret. Comput. Geom. 3: 339-348 (1988) - [j10]Bojan Mohar, Tomaz Pisanski, Martin Skoviera:
The Maximum Genus of Graph Bundles. Eur. J. Comb. 9(3): 215-224 (1988) - [j9]Bojan Mohar:
Embeddings of infinite graphs. J. Comb. Theory B 44(1): 29-43 (1988) - 1987
- [j8]Bojan Mohar:
The enumeration of akempic triangulations. J. Comb. Theory B 42(1): 14-23 (1987) - [j7]Bojan Mohar:
Simplicial schemes. J. Comb. Theory B 42(1): 68-86 (1987) - 1986
- [j6]Darko Babic, Ante Graovac, Bojan Mohar, Tomaz Pisanski:
The matching polynomial of a polygraph. Discret. Appl. Math. 15(1): 11-24 (1986) - [j5]Bojan Mohar:
On the cycle space of graphs. Discret. Math. 58(1): 79-80 (1986) - [j4]Bojan Mohar:
A common cover of graphs and 2-cell embeddings. J. Comb. Theory B 40(1): 94-106 (1986) - 1985
- [j3]Bojan Mohar:
Akempic triangulations with 4 odd vertices. Discret. Math. 54(1): 23-29 (1985) - [j2]Bojan Mohar, Tomaz Pisanski, Martin Skoviera, Arthur T. White:
The cartesian product of three triangles can be embedded into a surface of genus 7. Discret. Math. 56(1): 87-89 (1985) - [j1]Bojan Mohar, John Shawe-Taylor:
Distance-biregular graphs with 2-valent vertices and distance-regular line graphs. J. Comb. Theory B 38(3): 193-203 (1985)
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-12-10 20:51 CET 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:
