Bojan Mohar - RankMe

311 papers A* 19A 9B 4C 2Journal 272Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Hermitian adjacency matrices with at most three distinct eigenvalues. Discret. Math. Saieed Akbari, Jonathan Aloni, Maxwell Levit, Bojan Mohar, Steven Xia
2026	J	`jnl`	Strong log-convexity of genus sequences. J. Comb. Theory B Bojan Mohar
2026	J	`jnl`	The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring. CoRR Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Carsten Thomassen, Mikkel Thorup
2026	A*	`conf`	Three-edge-coloring (Tait coloring) cubic graphs and nowhere-zero 4-flow for graphs on the torus. SODA Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Tomohiro Sonobe
2025	J	`jnl`	A Linear Lower Bound for the Square Energy of Graphs. Electron. J. Comb. Saieed Akbari, Hitesh Kumar, Bojan Mohar, Shivaramakrishna Pragada
2025	J	`jnl`	Automorphisms and Isomorphisms of Maps in Linear Time. ACM Trans. Algorithms Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman
2025	J	`jnl`	Clustered Colouring of Graph Products. Electron. J. Comb. Rutger Campbell, Jochen Pascal Gollin, Kevin Hendrey, Thomas Lesgourgues, Bojan Mohar, Youri Tamitegama, Jane Tan, David R. Wood
2024	J	`jnl`	Cops and Robber on Hyperbolic Manifolds. CoRR Vesna Irsic, Bojan Mohar, Alexandra Wesolek
2024	J	`jnl`	Efficient polynomial-time approximation scheme for the genus of dense graphs. J. ACM Yifan Jing, Bojan Mohar
2024	B	`conf`	Exact Algorithms for Clustered Planarity with Linear Saturators. ISAAC Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi
2024	J	`jnl`	Exact Algorithms for Clustered Planarity with Linear Saturators. CoRR Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi
2024	J	`jnl`	Excluded minors for the Klein bottle I. Low connectivity case. J. Comb. Theory B Bojan Mohar, Petr Skoda
2024	J	`jnl`	Excluded minors for the Klein bottle II. Cascades. J. Comb. Theory B Bojan Mohar, Petr Skoda
2024	J	`jnl`	Guarding isometric subgraphs and Cops and Robber in planar graphs. CoRR Sebastián González Hermosillo de la Maza, Bojan Mohar
2024	J	`jnl`	Guarding isometric subgraphs and cops and robber in planar graphs. Eur. J. Comb. Sebastián González Hermosillo de la Maza, Bojan Mohar
2024	J	`jnl`	List-Avoiding Orientations. Comb. Peter Bradshaw, Yaobin Chen, Hao Ma, Bojan Mohar, Hehui Wu
2024	A*	`ed.`	Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, BC, Canada, June 24-28, 2024 STOC Bojan Mohar, Igor Shinkar, Ryan O'Donnell
2024	A*	`conf`	Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. SODA Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal
2024	A*	`conf`	Three-Edge-Coloring Projective Planar Cubic Graphs: A Generalization of the Four Color Theorem. FOCS Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Tomohiro Sonobe
2024	J	`jnl`	Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem. CoRR Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Tomohiro Sonobe
2024	J	`jnl`	Treewidth, Circle Graphs, and Circular Drawings. SIAM J. Discret. Math. Robert Hickingbotham, Freddie Illingworth, Bojan Mohar, David R. Wood
2023	J	`jnl`	Expected number of faces in a random embedding of any graph is at most linear. Comb. Probab. Comput. Jesse Campion Loth, Bojan Mohar
2023	J	`jnl`	Graphs of Linear Growth have Bounded Treewidth. Electron. J. Comb. Rutger Campbell, Marc Distel, Jochen Pascal Gollin, Daniel J. Harvey, Kevin Hendrey, Robert Hickingbotham, Bojan Mohar, David R. Wood
2023	J	`jnl`	On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs. SIAM J. Discret. Math. Zdenek Dvorák, Bojan Mohar
2023	J	`jnl`	On the cop number of graphs of high girth. J. Graph Theory Peter Bradshaw, Seyyed Aliasghar Hosseini, Bojan Mohar, Ladislav Stacho
2023	J	`jnl`	Proper orientations and proper chromatic number. J. Comb. Theory B Yaobin Chen, Bojan Mohar, Hehui Wu
2023	J	`jnl`	Robin Thomas (1962-2020). J. Comb. Theory B Michael Krivelevich, Bojan Mohar
2022	J	`jnl`	Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12. Comb. Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
2022	J	`jnl`	Embedding Graphs into Two-Dimensional Simplicial Complexes. Comput. Geom. Topol. Éric Colin de Verdière, Thomas Magnard, Bojan Mohar
2022	J	`jnl`	Inducibility and universality for trees. Comb. Theory Timothy F. N. Chan, Daniel Král', Bojan Mohar, David R. Wood
2022	J	`jnl`	Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. CoRR Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal
2022	J	`jnl`	Subgraphs of Kneser graphs with large girth and large chromatic number. Art Discret. Appl. Math. Bojan Mohar, Hehui Wu
2022	J	`jnl`	The Sandpile Group of Polygon Rings and Twisted Polygon Rings. Graphs Comb. Haiyan Chen, Bojan Mohar
2022	J	`jnl`	The evolution of the structure of ABC-minimal trees. J. Comb. Theory B Seyyed Aliasghar Hosseini, Bojan Mohar, Mohammad Bagher Ahmadi
2022	J	`jnl`	Triangle-free subgraphs with large fractional chromatic number. Comb. Probab. Comput. Bojan Mohar, Hehui Wu
2021	A*	`conf`	Automorphisms and Isomorphisms of Maps in Linear Time. ICALP Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman
2021	J	`jnl`	Cops and robbers on oriented toroidal grids. Theor. Comput. Sci. Sebastián González Hermosillo de la Maza, Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar, Bruce A. Reed
2021	J	`jnl`	Meyniel's conjecture on graphs of bounded degree. J. Graph Theory Seyyed Aliasghar Hosseini, Bojan Mohar, Sebastián González Hermosillo de la Maza
2021	J	`jnl`	Random 2-cell embeddings of multistars. CoRR Jesse Campion Loth, Kevin Halasz, Tomás Masarík, Bojan Mohar, Robert Sámal
2021	J	`jnl`	Reflexive coloring complexes for 3-edge-colorings of cubic graphs. Discret. Math. Fiachra Knox, Bojan Mohar, Nathan Singer
2021	J	`jnl`	Short rainbow cycles in graphs and matroids. J. Graph Theory Matt DeVos, Matthew Drescher, Daryl Funk, Sebastián González Hermosillo de la Maza, Krystal Guo, Tony Huynh, Bojan Mohar, Amanda Montejano
2021	J	`jnl`	The Inverse Voronoi Problem in Graphs II: Trees. Algorithmica Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés
2021	J	`jnl`	The last temptation of William T. Tutte. Eur. J. Comb. Bojan Mohar, Nathan Singer
2020	J	`jnl`	Automorphism groups of maps in linear time. CoRR Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman
2020	J	`jnl`	Cops and Robbers on Graphs of Bounded Diameter. SIAM J. Discret. Math. Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar
2020	J	`jnl`	Efficient polynomial-time approximation scheme for the genus of dense graphs. CoRR Yifan Jing, Bojan Mohar
2020	J	`jnl`	Fractional chromatic number of a random subgraph. J. Graph Theory Bojan Mohar, Hehui Wu
2020	J	`jnl`	Guest Editors' Foreword. Discret. Comput. Geom. Gil Kalai, Bojan Mohar, Isabella Novik
2020	A	`conf`	Limiting Crossing Numbers for Geodesic Drawings on the Sphere. GD Marthe Bonamy, Bojan Mohar, Alexandra Wesolek
2020	J	`jnl`	Limiting crossing numbers for geodesic drawings on the sphere. CoRR Marthe Bonamy, Bojan Mohar, Alexandra Wesolek
2020	J	`jnl`	Maximum number of colourings: 4-chromatic graphs. J. Comb. Theory B Fiachra Knox, Bojan Mohar
2020	J	`jnl`	On the cop number of graphs of high girth. CoRR Peter Bradshaw, Seyyed Aliasghar Hosseini, Bojan Mohar, Ladislav Stacho
2020	J	`jnl`	Ron Graham (1935-2020). J. Comb. Theory B Michael Krivelevich, Bojan Mohar
2020	J	`jnl`	The Inverse Voronoi Problem in Graphs I: Hardness. Algorithmica Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés
2020	J	`jnl`	The genus of complete 3-uniform hypergraphs. J. Comb. Theory B Yifan Jing, Bojan Mohar
2019	J	`jnl`	A Golden Ratio Inequality for Vertex Degrees of Graphs. Am. Math. Mon. Fiachra Knox, Bojan Mohar, David R. Wood
2019	A*	`conf`	Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12. SoCG Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
2019	J	`jnl`	Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12. CoRR Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
2019	J	`jnl`	Cops and Robbers on graphs of bounded diameter. CoRR Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar
2019	J	`jnl`	Cops and robbers on oriented toroidal grids. CoRR Sebastián González Hermosillo de la Maza, Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar, Bruce A. Reed
2019	J	`jnl`	Exponentially Many Nowhere-Zero ℤ Comb. Zdenek Dvorák, Bojan Mohar, Robert Sámal
2019	J	`jnl`	Fractional Decompositions and the Smallest-eigenvalue Separation. Electron. J. Comb. Fiachra Knox, Bojan Mohar
2019	J	`jnl`	Maximum Number of Colourings: 5-Chromatic Case. Electron. J. Comb. Fiachra Knox, Bojan Mohar
2019	J	`jnl`	Meyniel's conjecture on graphs of bounded degree. CoRR Seyyed Aliasghar Hosseini, Bojan Mohar, Sebastián González Hermosillo de la Maza
2019	J	`jnl`	The sandpile group of a polygon flower. Discret. Appl. Math. Haiyan Chen, Bojan Mohar
2018	A*	`conf`	A submodular measure and approximate Gomory-Hu theorem for packing odd trails. SODA Ross Churchley, Bojan Mohar
2018	J	`jnl`	Bishellable drawings of K SIAM J. Discret. Math. Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Dan McQuillan, Bojan Mohar, Petra Mutzel, Pedro Ramos, R. Bruce Richter, Birgit Vogtenhuber
2018	A*	`conf`	Efficient Polynomial-Time Approximation Scheme for the Genus of Dense Graphs. FOCS Bojan Mohar, Yifan Jing
2018	A*	`conf`	Embedding Graphs into Two-Dimensional Simplicial Complexes. SoCG Éric Colin de Verdière, Thomas Magnard, Bojan Mohar
2018	J	`jnl`	Embedding graphs into two-dimensional simplicial complexes. CoRR Éric Colin de Verdière, Thomas Magnard, Bojan Mohar
2018	J	`jnl`	Finding a subdivision of a prescribed digraph of order 4. J. Graph Theory Frédéric Havet, Ana Karolinna Maia, Bojan Mohar
2018	J	`jnl`	Game of cops and robbers in oriented quotients of the integer grid. Discret. Math. Seyyed Aliasghar Hosseini, Bojan Mohar
2018	J	`jnl`	Grünbaum colorings of even triangulations on surfaces. J. Graph Theory Michal Kotrbcík, Naoki Matsumoto, Bojan Mohar, Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki, Andrej Vodopivec
2018	J	`jnl`	Minimal Normal Graph Covers. Comb. David Gajser, Bojan Mohar
2018	J	`jnl`	Short rainbow cycles in sparse graphs. CoRR Matt DeVos, Sebastián González Hermosillo de la Maza, Krystal Guo, Daryl Funk, Tony Huynh, Bojan Mohar, Amanda Montejano
2018	A*	`conf`	Structure and Generation of Crossing-Critical Graphs. SoCG Zdenek Dvorák, Petr Hlinený, Bojan Mohar
2018	J	`jnl`	Structure and generation of crossing-critical graphs. CoRR Zdenek Dvorák, Petr Hlinený, Bojan Mohar
2018	J	`jnl`	The Crossing Number of the Cone of a Graph. SIAM J. Discret. Math. Carlos A. Alfaro, Alan Arroyo, Marek Dernár, Bojan Mohar
2018	J	`jnl`	The inverse Voronoi problem in graphs. CoRR Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés
2018	J	`jnl`	Tight Upper Bounds on the Crossing Number in a Minor-Closed Class. CoRR Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood
2017	J	`jnl`	5-choosability of graphs with crossings far apart. J. Comb. Theory B Zdenek Dvorák, Bernard Lidický, Bojan Mohar
2017	J	`jnl`	5-list-coloring planar graphs with distant precolored vertices. J. Comb. Theory B Zdenek Dvorák, Bernard Lidický, Bojan Mohar, Luke Postle
2017	J	`jnl`	Almost all regular graphs are normal. Discret. Appl. Math. Seyed Saeed Changiz Rezaei, Seyyed Aliasghar Hosseini, Bojan Mohar
2017	J	`jnl`	Dan Archdeacon (11 May 1954 to 18 February 2015). Ars Math. Contemp. Drago Bokal, Bojan Mohar, Jozef Sirán
2017	J	`jnl`	Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths. Discret. Math. Krystal Guo, Bojan Mohar
2017	J	`jnl`	Embedding quartic Eulerian digraphs on the plane. Australas. J Comb. Dan Archdeacon, C. Paul Bonnington, Bojan Mohar
2017	J	`jnl`	Exponentially many nowhere-zero ℝ Electron. Notes Discret. Math. Zdenek Dvorák, Bojan Mohar, Robert Sámal
2017	A	`conf`	Graphic TSP in Cubic Graphs. STACS Zdenek Dvorák, Daniel Král, Bojan Mohar
2017	J	`jnl`	Hermitian Adjacency Matrix of Digraphs and Mixed Graphs. J. Graph Theory Krystal Guo, Bojan Mohar
2017	J	`jnl`	Obstructions for two-vertex alternating embeddings of graphs in surfaces. Eur. J. Comb. Bojan Mohar, Petr Skoda
2017	J	`jnl`	Planar Digraphs of Digirth Five Are 2-Colorable. J. Graph Theory Ararat Harutyunyan, Bojan Mohar
2017	J	`jnl`	Planar Digraphs of Digirth Four are 2-Colorable. SIAM J. Discret. Math. Zhentao Li, Bojan Mohar
2017	J	`jnl`	Proper Orientations of Planar Bipartite Graphs. Graphs Comb. Fiachra Knox, Naoki Matsumoto, Sebastián González Hermosillo de la Maza, Bojan Mohar, Cláudia Linhares Sales
2017	J	`jnl`	Topological directions in Cops and Robbers. CoRR Anthony Bonato, Bojan Mohar
2017	J	`jnl`	Whitney's theorem for 2-regular planar digraphs. Australas. J Comb. Dan Archdeacon, Matt DeVos, Stefan Hannie, Bojan Mohar
2016	J	`jnl`	Crossing Numbers of Periodic Graphs. J. Graph Theory Zdenek Dvorák, Bojan Mohar
2016	J	`jnl`	Editorial. J. Comb. Theory B Michael Krivelevich, Bojan Mohar
2016	J	`jnl`	Graphic TSP in cubic graphs. CoRR Zdenek Dvorák, Daniel Král, Bojan Mohar
2016	J	`jnl`	Interval Minors of Complete Bipartite Graphs. J. Graph Theory Bojan Mohar, Arash Rafiey, Behruz Tayfeh-Rezaie, Hehui Wu
2016	J	`jnl`	Median Eigenvalues of Bipartite Subcubic Graphs. Comb. Probab. Comput. Bojan Mohar
2016	J	`jnl`	Planar digraphs of digirth four are 2-colourable. CoRR Zhentao Li, Bojan Mohar
2016	A	`conf`	The Crossing Number of the Cone of a Graph. GD Carlos A. Alfaro, Alan Arroyo, Marek Dernár, Bojan Mohar
2016	A*	`conf`	Weak duality for packing edge-disjoint odd ( SODA Ross Churchley, Bojan Mohar, Hehui Wu
2015	J	`jnl`	Bishellable drawings of K CoRR Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Dan McQuillan, Bojan Mohar, Petra Mutzel, Pedro Ramos, R. Bruce Richter, Birgit Vogtenhuber
2015	J	`jnl`	Corrigendum to "Many large eigenvalues in sparse graphs" [European J. Combin. 34(2013) 1125-1129]. Eur. J. Comb. Bojan Mohar
2015	J	`jnl`	Drawing a disconnected graph on the torus (Extended abstract). Electron. Notes Discret. Math. Sergio Cabello, Bojan Mohar, Robert Sámal
2015	A*	`conf`	Four terminal planar Delta-Wye reducibility via rooted SODA Lino Demasi, Bojan Mohar
2015	J	`jnl`	Highly arc-transitive digraphs - Structure and counterexamples. Comb. Matt DeVos, Bojan Mohar, Robert Sámal
2015	J	`jnl`	Median eigenvalues and the HOMO-LUMO index of graphs. J. Comb. Theory B Bojan Mohar
2015	J	`jnl`	Triangle-free subgraphs with large fractional chromatic number. Electron. Notes Discret. Math. Bojan Mohar, Hehui Wu
2014	J	`jnl`	A minimum degree condition forcing complete graph immersion. Comb. Matt DeVos, Zdenek Dvorák, Jacob Fox, Jessica McDonald, Bojan Mohar, Diego Scheide
2014	J	`jnl`	Homological Face-Width Condition Forcing K SIAM J. Discret. Math. Roi Krakovski, Bojan Mohar
2014	J	`jnl`	Integral Cayley Graphs and Groups. SIAM J. Discret. Math. Azhvan Sheikh Ahmady, Jason P. Bell, Bojan Mohar
2014	J	`jnl`	Interval minors of complete bipartite graphs. CoRR Bojan Mohar, Arash Rafiey, Behruz Tayfeh-Rezaie, Hehui Wu
2014	A	`conf`	Ordering without Forbidden Patterns. ESA Pavol Hell, Bojan Mohar, Arash Rafiey
2014	J	`jnl`	Ordering without forbidden patterns. CoRR Pavol Hell, Bojan Mohar, Arash Rafiey
2014	J	`jnl`	Packing Triangles in Weighted Graphs. SIAM J. Discret. Math. Guillaume Chapuy, Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide
2013	J	`jnl`	A Note on Forbidding Clique Immersions. Electron. J. Comb. Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide
2013	J	`jnl`	Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard. SIAM J. Comput. Sergio Cabello, Bojan Mohar
2013	J	`jnl`	Chromatic number and complete graph substructures for degree sequences. Comb. Zdenek Dvorák, Bojan Mohar
2013	J	`jnl`	Digraph Girth via Chromatic Number. SIAM J. Discret. Math. Peter Keevash, Zhentao Li, Bojan Mohar, Bruce A. Reed
2013	J	`jnl`	Integral Cayley Multigraphs over Abelian and Hamiltonian Groups. Electron. J. Comb. Matt DeVos, Roi Krakovski, Bojan Mohar, Azhvan Sheikh Ahmady
2013	J	`jnl`	Local chromatic number of quadrangulations of surfaces. Comb. Bojan Mohar, Gábor Simonyi, Gábor Tardos
2013	J	`jnl`	Many large eigenvalues in sparse graphs. Eur. J. Comb. Bojan Mohar
2013	J	`jnl`	Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing. J. Graph Theory Vladimir P. Korzhik, Bojan Mohar
2013	J	`jnl`	Star Chromatic Index. J. Graph Theory Zdenek Dvorák, Bojan Mohar, Robert Sámal
2013	J	`jnl`	The excluded minor structure theorem with planarly embedded wall. Ars Math. Contemp. Bojan Mohar
2012	J	`jnl`	5-list-coloring planar graphs with distant precolored vertices CoRR Zdenek Dvorák, Bernard Lidický, Bojan Mohar, Luke Postle
2012	J	`jnl`	Adding one edge to planar graphs makes crossing number and 1-planarity hard CoRR Sergio Cabello, Bojan Mohar
2012	J	`jnl`	Coloring Eulerian Triangulations of the Klein Bottle. Graphs Comb. Daniel Král', Bojan Mohar, Atsuhiro Nakamoto, Ondrej Pangrác, Yusuke Suzuki
2012	J	`jnl`	Degenerate and star colorings of graphs on surfaces. Eur. J. Comb. Bojan Mohar, Simon Spacapan
2012	J	`jnl`	Immersing complete digraphs. Eur. J. Comb. Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide
2012	J	`jnl`	Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs. J. Graph Theory Jessica McDonald, Bojan Mohar, Diego Scheide
2012	J	`jnl`	Linkless and Flat Embeddings in 3-Space. Discret. Comput. Geom. Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar
2012	J	`jnl`	Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph. J. Graph Algorithms Appl. Bojan Mohar, Petr Skoda
2012	J	`jnl`	Planar Graphs Have Exponentially Many 3-Arboricities. SIAM J. Discret. Math. Ararat Harutyunyan, Bojan Mohar
2012	J	`jnl`	Spectrally degenerate graphs: Hereditary case. J. Comb. Theory B Zdenek Dvorák, Bojan Mohar
2012	J	`jnl`	Two results on the digraph chromatic number. Discret. Math. Ararat Harutyunyan, Bojan Mohar
2011	J	`jnl`	Asymptotic enumeration and limit laws for graphs of fixed genus. J. Comb. Theory A Guillaume Chapuy, Éric Fusy, Omer Giménez, Bojan Mohar, Marc Noy
2011	J	`jnl`	Crossing Number and Weighted Crossing Number of Near-Planar Graphs. Algorithmica Sergio Cabello, Bojan Mohar
2011	J	`jnl`	Expected Crossing Numbers. Electron. Notes Discret. Math. Bojan Mohar, Tamon Stephen
2011	J	`jnl`	Gallai's Theorem for List Coloring of Digraphs. SIAM J. Discret. Math. Ararat Harutyunyan, Bojan Mohar
2011	C	`conf`	On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph. IWOCA Bojan Mohar, Petr Skoda
2011	J	`jnl`	Preface. Discret. Math. Gena Hahn, Bojan Mohar
2011	J	`jnl`	Strengthened Brooks' Theorem for Digraphs of Girth at least Three. Electron. J. Comb. Ararat Harutyunyan, Bojan Mohar
2011	J	`jnl`	The genus of Petersen powers. J. Graph Theory Bojan Mohar, Andrej Vodopivec
2011	J	`jnl`	Toughness of Electron. J. Comb. Guantao Chen, Yoshimi Egawa, Ken-ichi Kawarabayashi, Bojan Mohar, Katsuhiro Ota
2011	J	`jnl`	Unexpected behaviour of crossing sequences. J. Comb. Theory B Matt DeVos, Bojan Mohar, Robert Sámal
2010	—	`conf`	Adding one edge to planar graphs makes crossing number hard. SCG Sergio Cabello, Bojan Mohar
2010	J	`jnl`	An Eberhard-Like Theorem for Pentagons and Heptagons. Discret. Comput. Geom. Matt DeVos, Agelos Georgakopoulos, Bojan Mohar, Robert Sámal
2010	J	`jnl`	Approximation algorithms via contraction decomposition. Comb. Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar
2010	J	`jnl`	Crossing-critical graphs with large maximum degree. J. Comb. Theory B Zdenek Dvorák, Bojan Mohar
2010	B	`conf`	Do We Really Understand the Crossing Numbers? MFCS Bojan Mohar
2010	J	`jnl`	Finding one tight cycle. ACM Trans. Algorithms Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar
2010	J	`jnl`	Immersing small complete graphs. Ars Math. Contemp. Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar, Haruko Okamura
2010	—	`conf`	Linkless and flat embeddings in 3-space and the unknot problem. SCG Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar
2010	J	`jnl`	Preface. Discret. Math. Sandi Klavzar, Dragan Marusic, Bojan Mohar, Tomaz Pisanski
2010	J	`jnl`	Rigidity and Separation Indices of Graphs in Surfaces. Graphs Comb. Gasper Fijavz, Bojan Mohar
2010	J	`jnl`	Simplices and Spectra of Graphs. Discret. Comput. Geom. Bojan Mohar, Igor Rivin
2010	J	`jnl`	Spectral radius of finite and infinite planar graphs and of graphs of bounded genus. J. Comb. Theory B Zdenek Dvorák, Bojan Mohar
2010	J	`jnl`	Spectrally degenerate graphs: Hereditary case CoRR Zdenek Dvorák, Bojan Mohar
2010	J	`jnl`	Star Coloring and Acyclic Coloring of Locally Planar Graphs. SIAM J. Discret. Math. Ken-ichi Kawarabayashi, Bojan Mohar
2010	J	`jnl`	Strong embeddings of minimum genus. Discret. Math. Bojan Mohar
2009	J	`jnl`	Cayley sum graphs and eigenvalues of (3, 6)-fullerenes. J. Comb. Theory B Matt DeVos, Luis A. Goddyn, Bojan Mohar, Robert Sámal
2009	J	`jnl`	Linear connectivity forces large complete bipartite minors. J. Comb. Theory B Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar
2009	J	`jnl`	Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)] J. Comb. Theory B Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar
2009	A*	`conf`	List-color-critical graphs on a fixed surface. SODA Ken-ichi Kawarabayashi, Bojan Mohar
2009	J	`jnl`	On the sum of k largest eigenvalues of graphs and symmetric matrices. J. Comb. Theory B Bojan Mohar
2009	J	`jnl`	Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (extended abstract). Electron. Notes Discret. Math. Zdenek Dvorák, Bojan Mohar
2009	J	`jnl`	The Two-Coloring Number and Degenerate Colorings of Planar Graphs. SIAM J. Discret. Math. Hal A. Kierstead, Bojan Mohar, Simon Spacapan, Daqing Yang, Xuding Zhu
2009	J	`jnl`	The genus crossing number. Ars Math. Contemp. Bojan Mohar
2008	A*	`conf`	A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width. FOCS Ken-ichi Kawarabayashi, Bojan Mohar, Bruce A. Reed
2008	J	`jnl`	Coloring parameters for graphs on surfaces. Electron. Notes Discret. Math. Bojan Mohar, Simon Spacapan
2008	A	`conf`	Crossing and Weighted Crossing Number of Near-Planar Graphs. GD Sergio Cabello, Bojan Mohar
2008	A*	`conf`	Finding one tight cycle. SODA Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar
2008	A*	`conf`	Graph and map isomorphism and all polyhedral embeddings in linear time. STOC Ken-ichi Kawarabayashi, Bojan Mohar
2008	—	`conf`	Improved upper bounds on the crossing number. SCG Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood
2008	J	`jnl`	Locally planar graphs are 5-choosable. J. Comb. Theory B Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar
2008	A	`conf`	Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing. GD Vladimir P. Korzhik, Bojan Mohar
2008	J	`jnl`	Relating embedding and coloring properties of snarks. Ars Math. Contemp. Bojan Mohar, Eckhard Steffen, Andrej Vodopivec
2008	J	`jnl`	Unexpected behaviour of crossing sequences. Electron. Notes Discret. Math. Matt DeVos, Bojan Mohar, Robert Sámal
2007	J	`jnl`	A relaxed Hadwiger's Conjecture for list colorings. J. Comb. Theory B Ken-ichi Kawarabayashi, Bojan Mohar
2007	A*	`conf`	Approximation algorithms via contraction decomposition. SODA Erik D. Demaine, Mohammad Taghi Hajiaghayi, Bojan Mohar
2007	J	`jnl`	Circular Coloring the Plane. SIAM J. Discret. Math. Matt DeVos, Javad B. Ebrahimi, Mohammad Ghebleh, Luis A. Goddyn, Bojan Mohar, Reza Naserasr
2007	J	`jnl`	Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs. Discret. Comput. Geom. Sergio Cabello, Bojan Mohar
2007	J	`jnl`	Heuristic search for Hamilton cycles in cubic graphs. Discret. Math. Janez Ales, Bojan Mohar, Tomaz Pisanski
2007	J	`jnl`	Labeling planar graphs with a condition at distance two. Eur. J. Comb. Peter Bella, Daniel Král, Bojan Mohar, Katarína Quittnerová
2007	J	`jnl`	Obstructions for simple embeddings. Australas. J Comb. Martin Juvan, Joze Marincek, Bojan Mohar
2007	J	`jnl`	Preface. Discret. Math. Sandi Klavzar, Dragan Marusic, Bojan Mohar, Tomaz Pisanski
2007	J	`jnl`	Research problems from the 5th Slovenian Conference (Bled, 2003). Discret. Math. Bojan Mohar, Richard J. Nowakowski, Douglas B. West
2007	J	`jnl`	Some Recent Progress and Applications in Graph Minor Theory. Graphs Comb. Ken-ichi Kawarabayashi, Bojan Mohar
2006	A*	`conf`	Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. STOC Ken-ichi Kawarabayashi, Bojan Mohar
2006	J	`jnl`	Bar-Magnet Polyhedra and NS-Orientations of Maps. Discret. Comput. Geom. Bojan Mohar
2006	J	`jnl`	Coloring Vertices and Faces of Locally Planar Graphs. Graphs Comb. Michael O. Albertson, Bojan Mohar
2006	J	`jnl`	Expected Case for Projecting Points. Informatica (Slovenia) Sergio Cabello, Matt DeVos, Bojan Mohar
2006	J	`jnl`	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. Bojan Mohar
2006	J	`jnl`	On Polyhedral Embeddings of Cubic Graphs. Comb. Probab. Comput. Bojan Mohar, Andrej Vodopivec
2006	J	`jnl`	On the Crossing Number of Almost Planar Graphs. Informatica (Slovenia) Bojan Mohar
2006	J	`jnl`	Small separations in vertex-transitive graphs. Electron. Notes Discret. Math. Matt DeVos, Bojan Mohar
2006	J	`jnl`	The Minor Crossing Number. SIAM J. Discret. Math. Drago Bokal, Gasper Fijavz, Bojan Mohar
2006	J	`jnl`	Tree amalgamation of graphs and tessellations of the Cantor sphere. J. Comb. Theory B Bojan Mohar
2006	J	`jnl`	Universal obstructions for embedding extension problems. Australas. J Comb. Bojan Mohar
2005	J	`jnl`	2-restricted extensions of partial embeddings of graphs. Eur. J. Comb. Martin Juvan, Bojan Mohar
2005	J	`jnl`	Acyclic colorings of locally planar graphs. Eur. J. Comb. Bojan Mohar
2005	J	`jnl`	Crossing numbers of Sierpinski-like graphs. J. Graph Theory Sandi Klavzar, Bojan Mohar
2005	A	`conf`	Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs. ESA Sergio Cabello, Bojan Mohar
2005	J	`jnl`	Foreword. Eur. J. Comb. Bojan Mohar
2005	C	`conf`	Homotopic spanners. EuroCG Sergio Cabello, Bojan Mohar, Arjana Zitnik
2005	J	`jnl`	Triangulations and the Hajós Conjecture. Electron. J. Comb. Bojan Mohar
2004	J	`jnl`	A Spectral Approach to Graphical Representation of Data. Informatica (Slovenia) Drago Bokal, Martin Juvan, Bojan Mohar
2004	J	`jnl`	Cubic inflation, mirror graphs, regular maps, and partial cubes. Eur. J. Comb. Bostjan Bresar, Sandi Klavzar, Alenka Lipovec, Bojan Mohar
2004	J	`jnl`	Foreword. Eur. J. Comb. Bojan Mohar
2004	J	`jnl`	Hajós Theorem For Colorings Of Edge-Weighted Graphs. Comb. Bojan Mohar
2004	J	`jnl`	Rigidity and separation indices of Paley graphs. Discret. Math. Gasper Fijavz, Bojan Mohar
2004	J	`jnl`	Subdivisions of large complete bipartite graphs and long induced paths in J. Graph Theory Thomas Böhme, Bojan Mohar, Riste Skrekovski, Michael Stiebitz
2004	J	`jnl`	The circular chromatic number of a digraph. J. Graph Theory Drago Bokal, Gasper Fijavz, Martin Juvan, P. Mark Kayll, Bojan Mohar
2003	J	`jnl`	Acyclic Homomorphisms and Circular Colorings of Digraphs. SIAM J. Discret. Math. Tomás Feder, Pavol Hell, Bojan Mohar
2003	J	`jnl`	Blocking nonorientability of a surface. J. Comb. Theory B Bojan Mohar, Alexander Schrijver
2003	J	`jnl`	Circular colorings of edge-weighted graphs. J. Graph Theory Bojan Mohar
2003	J	`jnl`	Domination, Packing and Excluded Minors. Electron. J. Comb. Thomas Böhme, Bojan Mohar
2003	J	`jnl`	K Comb. Gasper Fijavz, Bojan Mohar
2003	J	`jnl`	Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9. J. Graph Theory Bojan Mohar, Riste Skrekovski, Heinz-Jürgen Voss
2003	J	`jnl`	On a list-coloring problem. Discret. Math. Sylvain Gravier, Frédéric Maffray, Bojan Mohar
2003	J	`jnl`	On constant-weight TSP-tours. Discuss. Math. Graph Theory Scott Jones, P. Mark Kayll, Bojan Mohar, Walter D. Wallis
2003	J	`jnl`	Preface. Discuss. Math. Graph Theory Sandi Klavzar, Bojan Mohar, Tomaz Pisanski, Norbert Seifter, Janez Zerovnik
2002	J	`jnl`	Coloring Eulerian triangulations of the projective plane. Discret. Math. Bojan Mohar
2002	J	`jnl`	Coloring Locally Bipartite Graphs on Surfaces. J. Comb. Theory B Bojan Mohar, Paul D. Seymour
2002	J	`jnl`	Labeled J. Comb. Theory B Thomas Böhme, Bojan Mohar
2002	J	`jnl`	Long Cycles in Graphs on a Fixed Surface. J. Comb. Theory B Thomas Böhme, Bojan Mohar, Carsten Thomassen
2002	J	`jnl`	On approximating the maximum diameter ratio of graphs. Discret. Math. Joze Marincek, Bojan Mohar
2002	J	`jnl`	Planar Graphs Without Cycles of Specific Lengths. Eur. J. Comb. Gasper Fijavz, Martin Juvan, Bojan Mohar, Riste Skrekovski
2002	J	`jnl`	Preface. Discret. Math. Sandi Klavzar, Dragan Marusic, Bojan Mohar
2002	J	`jnl`	The Chromatic Number Of Graph Powers. Comb. Probab. Comput. Noga Alon, Bojan Mohar
2001	J	`jnl`	Existence of Polyhedral Embeddings of Graphs. Comb. Bojan Mohar
2001	J	`jnl`	Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum. Electron. Notes Discret. Math. Simone Dantas, Sylvain Gravier, Frédéric Maffray, Bojan Mohar
2001	J	`jnl`	Face Covers and the Genus Problem for Apex Graphs. J. Comb. Theory B Bojan Mohar
2001	J	`jnl`	Flexibility of Polyhedral Embeddings of Graphs in Surfaces. J. Comb. Theory B Bojan Mohar, Neil Robertson
2001	—	`book`	Graphs on Surfaces. Bojan Mohar, Carsten Thomassen
2001	J	`jnl`	Nowhere-zero k-flows of Supergraphs. Electron. J. Comb. Bojan Mohar, Riste Skrekovski
2000	J	`jnl`	Light paths in 4-connected graphs in the plane and other surfaces. J. Graph Theory Bojan Mohar
2000	J	`jnl`	Some Topological Methods in Graph Coloring Theory. Electron. Notes Discret. Math. Bojan Mohar
1999	J	`jnl`	A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface. SIAM J. Discret. Math. Bojan Mohar
1999	J	`jnl`	Dirac's map-color theorem for choosability. J. Graph Theory Thomas Böhme, Bojan Mohar, Michael Stiebitz
1999	A	`conf`	Drawing Graphs in the Hyperbolic Plane. GD Bojan Mohar
1999	J	`jnl`	Graphs of degree 4 are 5-edge-choosable. J. Graph Theory Martin Juvan, Bojan Mohar, Riste Skrekovski
1999	J	`jnl`	List Edge-Colorings of Series-Parallel Graphs. Electron. J. Comb. Martin Juvan, Bojan Mohar, Robin Thomas
1999	J	`jnl`	The Grötzsch Theorem for the Hypergraph of Maximal Cliques. Electron. J. Comb. Bojan Mohar, Riste Skrekovski
1998	J	`jnl`	List Total Colourings of Graphs. Comb. Probab. Comput. Martin Juvan, Bojan Mohar, Riste Skrekovski
1998	J	`jnl`	Obstruction Sets for Outer-Projective-Planar Graphs. Ars Comb. Dan Archdeacon, Nora Hartsfield, C. H. C. Little, Bojan Mohar
1998	J	`jnl`	On list edge-colorings of subcubic graphs. Discret. Math. Martin Juvan, Bojan Mohar, Riste Skrekovski
1998	J	`jnl`	On the orientable genus of graphs with bounded nonorientable genus. Discret. Math. Bojan Mohar
1998	J	`jnl`	Preface. Discret. Math. Dragan Marusic, Bojan Mohar
1998	J	`jnl`	Tessellation and Visibility Representations of Maps on the Torus. Discret. Comput. Geom. Bojan Mohar, Pierre Rosenstiehl
1998	J	`jnl`	The number of matchings of low order in hexagonal systems. Discret. Math. Diego Klabjan, Bojan Mohar
1997	J	`jnl`	Apex graphs with embeddings of face-width three. Discret. Math. Bojan Mohar
1997	J	`jnl`	Circle Packings of Maps in Polynomial Time. Eur. J. Comb. Bojan Mohar
1997	J	`jnl`	Distance-related Invariants on Polygraphs. Discret. Appl. Math. Martin Juvan, Bojan Mohar, Janez Zerovnik
1997	J	`jnl`	Obstructions For 2-Möbius Band Embedding Extension Problem. SIAM J. Discret. Math. Martin Juvan, Bojan Mohar
1997	J	`jnl`	On the minimal genus of 2-complexes. J. Graph Theory Bojan Mohar
1997	J	`jnl`	Projective Plane and Möbius Band Obstructions. Comb. Bojan Mohar
1996	J	`jnl`	Disjoint Essential Cycles. J. Comb. Theory, Ser. B Bojan Mohar, Neil Robertson
1996	A*	`conf`	Embedding Graphs in an Arbitrary Surface in Linear Time. STOC Bojan Mohar
1996	J	`jnl`	Planar Graphs on Nonplanar Surfaces. J. Comb. Theory, Ser. B Bojan Mohar, Neil Robertson
1996	J	`jnl`	Planar graphs on the projective plane. Discret. Math. Bojan Mohar, Neil Robertson, Richard P. Vitray
1996	J	`jnl`	Separating and Nonseparating Disjoint Homotopic Cycles in Graph Embeddings. J. Comb. Theory B Richard Brunet, Bojan Mohar, R. Bruce Richter
1996	J	`jnl`	Straight-line representations of maps on the torus and other flat surfaces. Discret. Math. Bojan Mohar
1996	J	`jnl`	Systems of Curves on Surfaces. J. Comb. Theory, Ser. B Martin Juvan, Aleksander Malnic, Bojan Mohar
1996	J	`jnl`	The Quasi-Wiener and the Kirchhoff Indices Coincide. J. Chem. Inf. Comput. Sci. Ivan Gutman, Bojan Mohar
1995	J	`jnl`	Bond Contributions to the Wiener Index. J. Chem. Inf. Comput. Sci. Martin Juvan, Bojan Mohar
1995	J	`jnl`	Coloring graph bundles. J. Graph Theory Sandi Klavzar, Bojan Mohar
1995	B	`conf`	Embedding Graphs in the Torus in Linear Time. IPCO Martin Juvan, Joze Marincek, Bojan Mohar
1995	J	`jnl`	Fast computation of the Wiener index of fasciagraphs and rotagraphs. J. Chem. Inf. Comput. Sci. Martin Juvan, Bojan Mohar, Ante Graovac, Sandi Klavzar, Janez Zerovnik
1995	J	`jnl`	Labeling of Benzenoid Systems which Reflects the Vertex-Distance Relations. J. Chem. Inf. Comput. Sci. Sandi Klavzar, Ivan Gutman, Bojan Mohar
1995	J	`jnl`	The chromatic numbers of graph bundles over cycles. Discret. Math. Sandi Klavzar, Bojan Mohar
1995	J	`jnl`	Uniqueness and Minimality of Large Face-Width Embeddings of Graphs. Comb. Bojan Mohar
1994	A	`conf`	A Flow Approach to Upward Drawings of Toroidal Maps. GD Bojan Mohar, Pierre Rosenstiehl
1994	J	`jnl`	Coloring Graphs without Short Non-bounding Cycles. J. Comb. Theory B Steve Fisk, Bojan Mohar
1994	J	`jnl`	Convex Representations of Maps on the Torus and Other Flat Surfaces. Discret. Comput. Geom. Bojan Mohar
1994	J	`jnl`	Extremal Mono-q-polyhexes. J. Chem. Inf. Comput. Sci. Bojan Mohar
1994	J	`jnl`	Obstructions for the Disk and the Cylinder Embedding Extension Problems. Comb. Probab. Comput. Bojan Mohar
1994	J	`jnl`	Preface. Discret. Math. Vladimir Batagelj, Dragan Marusic, Bojan Mohar, Tomaz Pisanski
1994	J	`jnl`	Surface triangulations with isometric boundary. Discret. Math. Steve Fisk, Bojan Mohar
1993	J	`jnl`	7-critical graphs of bounded genus. Discret. Math. Bojan Mohar
1993	J	`jnl`	A novel definition of the Wiener index for trees. J. Chem. Inf. Comput. Sci. Bojan Mohar, Darko Babic, Nenad Trinajstic
1993	J	`jnl`	A polynomial time circle packing algorithm. Discret. Math. Bojan Mohar
1993	B	`conf`	A spectral approach to bandwidth and separator problems in graphs. IPCO Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl
1993	J	`jnl`	Circle packing representation in the plane and other surfaces. SIGACT News Bojan Mohar
1993	J	`jnl`	Laplace eigenvalues and bandwidth-type invariants of graphs. J. Graph Theory Martin Juvan, Bojan Mohar
1993	J	`jnl`	Projective Planarity in Linear Time. J. Algorithms Bojan Mohar
1992	J	`jnl`	A domain monotonicity theorem for graphs and Hamiltonicity. Discret. Appl. Math. Bojan Mohar
1992	J	`jnl`	Generating locally cyclic triangulations of surfaces. J. Comb. Theory B Aleksander Malnic, Bojan Mohar
1992	J	`jnl`	Laplace eigenvalues of graphs - a survey. Discret. Math. Bojan Mohar
1992	J	`jnl`	Optimal linear labelings and eigenvalues of graphs. Discret. Appl. Math. Martin Juvan, Bojan Mohar
1991	—	`conf`	Disjoint Essential Circuits in Toroidal Maps. Planar Graphs Bojan Mohar, Neil Robertson
1991	J	`jnl`	Eigenvalues, diameter, and mean distance in graphs. Graphs Comb. Bojan Mohar
1991	J	`jnl`	Some relations between analytic and geometric properties of infinite graphs. Discret. Math. Bojan Mohar
1990	J	`jnl`	Embeddings of cartesian products of nearly bipartite graphs. J. Graph Theory Bojan Mohar, Tomaz Pisanski, Arthur T. White
1989	J	`jnl`	An obstruction to embedding graphs in surfaces. Discret. Math. Bojan Mohar
1989	J	`jnl`	Isoperimetric numbers of graphs. J. Comb. Theory B Bojan Mohar
1988	J	`jnl`	Branced Covering. Discret. Comput. Geom. Bojan Mohar
1988	J	`jnl`	Embeddings of infinite graphs. J. Comb. Theory B Bojan Mohar
1988	J	`jnl`	Nonorientable Genus of Nearly Complete Bipartite Graphs. Discret. Comput. Geom. Bojan Mohar
1988	J	`jnl`	The Maximum Genus of Graph Bundles. Eur. J. Comb. Bojan Mohar, Tomaz Pisanski, Martin Skoviera
1987	J	`jnl`	Simplicial schemes. J. Comb. Theory B Bojan Mohar
1987	J	`jnl`	The enumeration of akempic triangulations. J. Comb. Theory B Bojan Mohar
1986	J	`jnl`	A common cover of graphs and 2-cell embeddings. J. Comb. Theory B Bojan Mohar
1986	J	`jnl`	On the cycle space of graphs. Discret. Math. Bojan Mohar
1986	J	`jnl`	The matching polynomial of a polygraph. Discret. Appl. Math. Darko Babic, Ante Graovac, Bojan Mohar, Tomaz Pisanski
1985	J	`jnl`	Akempic triangulations with 4 odd vertices. Discret. Math. Bojan Mohar
1985	J	`jnl`	Distance-biregular graphs with 2-valent vertices and distance-regular line graphs. J. Comb. Theory B Bojan Mohar, John Shawe-Taylor
1985	J	`jnl`	The cartesian product of three triangles can be embedded into a surface of genus 7. Discret. Math. Bojan Mohar, Tomaz Pisanski, Martin Skoviera, Arthur T. White