Akempic triangulations with 4 odd vertices. - Bojan Mohar (Discret. Math., 1985)

The cartesian product of three triangles can be embedded into a surface of genus 7. - Bojan Mohar; Tomaz Pisanski; Martin Skoviera; Arthur T. White (Discret. Math., 1985)

Distance-biregular graphs with 2-valent vertices and distance-regular line graphs. - Bojan Mohar; John Shawe-Taylor (J. Comb. Theory B, 1985)

The matching polynomial of a polygraph. - Darko Babic; Ante Graovac; Bojan Mohar; Tomaz Pisanski (Discret. Appl. Math., 1986)

On the cycle space of graphs. - Bojan Mohar (Discret. Math., 1986)

A common cover of graphs and 2-cell embeddings. - Bojan Mohar (J. Comb. Theory B, 1986)

The enumeration of akempic triangulations. - Bojan Mohar (J. Comb. Theory B, 1987)

Simplicial schemes. - Bojan Mohar (J. Comb. Theory B, 1987)

Nonorientable Genus of Nearly Complete Bipartite Graphs. - Bojan Mohar (Discret. Comput. Geom., 1988)

Branced Covering. - Bojan Mohar (Discret. Comput. Geom., 1988)

The Maximum Genus of Graph Bundles. - Bojan Mohar; Tomaz Pisanski; Martin Skoviera (Eur. J. Comb., 1988)

Embeddings of infinite graphs. - Bojan Mohar (J. Comb. Theory B, 1988)

An obstruction to embedding graphs in surfaces. - Bojan Mohar (Discret. Math., 1989)

Isoperimetric numbers of graphs. - Bojan Mohar (J. Comb. Theory B, 1989)

Embeddings of cartesian products of nearly bipartite graphs. - Bojan Mohar; Tomaz Pisanski; Arthur T. White (J. Graph Theory, 1990)

Disjoint Essential Circuits in Toroidal Maps. - Bojan Mohar; Neil Robertson 001 (Planar Graphs, 1991)

Some relations between analytic and geometric properties of infinite graphs. - Bojan Mohar (Discret. Math., 1991)

Eigenvalues, diameter, and mean distance in graphs. - Bojan Mohar (Graphs Comb., 1991)

Optimal linear labelings and eigenvalues of graphs. - Martin Juvan; Bojan Mohar (Discret. Appl. Math., 1992)

A domain monotonicity theorem for graphs and Hamiltonicity. - Bojan Mohar (Discret. Appl. Math., 1992)

Laplace eigenvalues of graphs - a survey. - Bojan Mohar (Discret. Math., 1992)

Generating locally cyclic triangulations of surfaces. - Aleksander Malnic; Bojan Mohar (J. Comb. Theory B, 1992)

A spectral approach to bandwidth and separator problems in graphs. - Christoph Helmberg; Bojan Mohar; Svatopluk Poljak; Franz Rendl (IPCO, 1993)

7-critical graphs of bounded genus. - Bojan Mohar (Discret. Math., 1993)

A polynomial time circle packing algorithm. - Bojan Mohar (Discret. Math., 1993)

Projective Planarity in Linear Time. - Bojan Mohar (J. Algorithms, 1993)

A novel definition of the Wiener index for trees. - Bojan Mohar; Darko Babic; Nenad Trinajstic (J. Chem. Inf. Comput. Sci., 1993)

Laplace eigenvalues and bandwidth-type invariants of graphs. - Martin Juvan; Bojan Mohar (J. Graph Theory, 1993)

Circle packing representation in the plane and other surfaces. - Bojan Mohar (SIGACT News, 1993)

A Flow Approach to Upward Drawings of Toroidal Maps. - Bojan Mohar; Pierre Rosenstiehl (GD, 1994)

Obstructions for the Disk and the Cylinder Embedding Extension Problems. - Bojan Mohar (Comb. Probab. Comput., 1994)

Convex Representations of Maps on the Torus and Other Flat Surfaces. - Bojan Mohar (Discret. Comput. Geom., 1994)

Preface. - Vladimir Batagelj; Dragan Marusic; Bojan Mohar; Tomaz Pisanski (Discret. Math., 1994)

Surface triangulations with isometric boundary. - Steve Fisk; Bojan Mohar (Discret. Math., 1994)

Extremal Mono-q-polyhexes. - Bojan Mohar (J. Chem. Inf. Comput. Sci., 1994)

Coloring Graphs without Short Non-bounding Cycles. - Steve Fisk; Bojan Mohar (J. Comb. Theory B, 1994)

Embedding Graphs in the Torus in Linear Time. - Martin Juvan; Joze Marincek; Bojan Mohar (IPCO, 1995)

Uniqueness and Minimality of Large Face-Width Embeddings of Graphs. - Bojan Mohar (Comb., 1995)

The chromatic numbers of graph bundles over cycles. - Sandi Klavzar; Bojan Mohar (Discret. Math., 1995)

Bond Contributions to the Wiener Index. - Martin Juvan; Bojan Mohar (J. Chem. Inf. Comput. Sci., 1995)

Fast computation of the Wiener index of fasciagraphs and rotagraphs. - Martin Juvan; Bojan Mohar; Ante Graovac; Sandi Klavzar; Janez Zerovnik (J. Chem. Inf. Comput. Sci., 1995)

Labeling of Benzenoid Systems which Reflects the Vertex-Distance Relations. - Sandi Klavzar; Ivan Gutman; Bojan Mohar (J. Chem. Inf. Comput. Sci., 1995)

Coloring graph bundles. - Sandi Klavzar; Bojan Mohar (J. Graph Theory, 1995)

Embedding Graphs in an Arbitrary Surface in Linear Time. - Bojan Mohar (STOC, 1996)

Straight-line representations of maps on the torus and other flat surfaces. - Bojan Mohar (Discret. Math., 1996)

Planar graphs on the projective plane. - Bojan Mohar; Neil Robertson 001; Richard P. Vitray (Discret. Math., 1996)

The Quasi-Wiener and the Kirchhoff Indices Coincide. - Ivan Gutman; Bojan Mohar (J. Chem. Inf. Comput. Sci., 1996)

Separating and Nonseparating Disjoint Homotopic Cycles in Graph Embeddings. - Richard Brunet; Bojan Mohar; R. Bruce Richter (J. Comb. Theory B, 1996)

Systems of Curves on Surfaces. - Martin Juvan; Aleksander Malnic; Bojan Mohar (J. Comb. Theory, Ser. B, 1996)

Planar Graphs on Nonplanar Surfaces. - Bojan Mohar; Neil Robertson 001 (J. Comb. Theory, Ser. B, 1996)

Disjoint Essential Cycles. - Bojan Mohar; Neil Robertson 001 (J. Comb. Theory, Ser. B, 1996)

Projective Plane and Möbius Band Obstructions. - Bojan Mohar (Comb., 1997)

Distance-related Invariants on Polygraphs. - Martin Juvan; Bojan Mohar; Janez Zerovnik (Discret. Appl. Math., 1997)

Apex graphs with embeddings of face-width three. - Bojan Mohar (Discret. Math., 1997)

Circle Packings of Maps in Polynomial Time. - Bojan Mohar (Eur. J. Comb., 1997)

On the minimal genus of 2-complexes. - Bojan Mohar (J. Graph Theory, 1997)

Obstructions For 2-Möbius Band Embedding Extension Problem. - Martin Juvan; Bojan Mohar (SIAM J. Discret. Math., 1997)

Obstruction Sets for Outer-Projective-Planar Graphs. - Dan Archdeacon; Nora Hartsfield; C. H. C. Little; Bojan Mohar (Ars Comb., 1998)

List Total Colourings of Graphs. - Martin Juvan; Bojan Mohar; Riste Skrekovski (Comb. Probab. Comput., 1998)

Tessellation and Visibility Representations of Maps on the Torus. - Bojan Mohar; Pierre Rosenstiehl (Discret. Comput. Geom., 1998)

On list edge-colorings of subcubic graphs. - Martin Juvan; Bojan Mohar; Riste Skrekovski (Discret. Math., 1998)

The number of matchings of low order in hexagonal systems. - Diego Klabjan; Bojan Mohar (Discret. Math., 1998)

Preface. - Dragan Marusic; Bojan Mohar (Discret. Math., 1998)

On the orientable genus of graphs with bounded nonorientable genus. - Bojan Mohar (Discret. Math., 1998)

Drawing Graphs in the Hyperbolic Plane. - Bojan Mohar (GD, 1999)

List Edge-Colorings of Series-Parallel Graphs. - Martin Juvan; Bojan Mohar; Robin Thomas 001 (Electron. J. Comb., 1999)

The Grötzsch Theorem for the Hypergraph of Maximal Cliques. - Bojan Mohar; Riste Skrekovski (Electron. J. Comb., 1999)

Dirac's map-color theorem for choosability. - Thomas Böhme 001; Bojan Mohar; Michael Stiebitz (J. Graph Theory, 1999)

Graphs of degree 4 are 5-edge-choosable. - Martin Juvan; Bojan Mohar; Riste Skrekovski (J. Graph Theory, 1999)

A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface. - Bojan Mohar (SIAM J. Discret. Math., 1999)

Some Topological Methods in Graph Coloring Theory. - Bojan Mohar (Electron. Notes Discret. Math., 2000)

Light paths in 4-connected graphs in the plane and other surfaces. - Bojan Mohar (J. Graph Theory, 2000)

Graphs on Surfaces. - Bojan Mohar; Carsten Thomassen (Johns Hopkins University Press, 2001)

Existence of Polyhedral Embeddings of Graphs. - Bojan Mohar (Comb., 2001)

Nowhere-zero k-flows of Supergraphs. - Bojan Mohar; Riste Skrekovski (Electron. J. Comb., 2001)

Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum. - Simone Dantas; Sylvain Gravier; Frédéric Maffray; Bojan Mohar (Electron. Notes Discret. Math., 2001)

Face Covers and the Genus Problem for Apex Graphs. - Bojan Mohar (J. Comb. Theory B, 2001)

Flexibility of Polyhedral Embeddings of Graphs in Surfaces. - Bojan Mohar; Neil Robertson 001 (J. Comb. Theory B, 2001)

The Chromatic Number Of Graph Powers. - Noga Alon; Bojan Mohar (Comb. Probab. Comput., 2002)

Preface. - Sandi Klavzar; Dragan Marusic; Bojan Mohar (Discret. Math., 2002)

On approximating the maximum diameter ratio of graphs. - Joze Marincek; Bojan Mohar (Discret. Math., 2002)

Coloring Eulerian triangulations of the projective plane. - Bojan Mohar (Discret. Math., 2002)

Planar Graphs Without Cycles of Specific Lengths. - Gasper Fijavz; Martin Juvan; Bojan Mohar; Riste Skrekovski (Eur. J. Comb., 2002)

Labeled K2, t Minors in Plane Graphs. - Thomas Böhme 001; Bojan Mohar (J. Comb. Theory B, 2002)

Ka, k Minors in Graphs of Bounded Tree-Width. - Thomas Böhme 001; John Maharry; Bojan Mohar (J. Comb. Theory B, 2002)

Long Cycles in Graphs on a Fixed Surface. - Thomas Böhme 001; Bojan Mohar; Carsten Thomassen (J. Comb. Theory B, 2002)

Coloring Locally Bipartite Graphs on Surfaces. - Bojan Mohar; Paul D. Seymour (J. Comb. Theory B, 2002)

K6-Minors in Projective Planar Graphs. - Gasper Fijavz; Bojan Mohar (Comb., 2003)

Domination, Packing and Excluded Minors. - Thomas Böhme 001; Bojan Mohar (Electron. J. Comb., 2003)

On a list-coloring problem. - Sylvain Gravier; Frédéric Maffray; Bojan Mohar (Discret. Math., 2003)

On constant-weight TSP-tours. - Scott Jones; P. Mark Kayll; Bojan Mohar; Walter D. Wallis (Discuss. Math. Graph Theory, 2003)

Preface. - Sandi Klavzar; Bojan Mohar; Tomaz Pisanski; Norbert Seifter; Janez Zerovnik (Discuss. Math. Graph Theory, 2003)

Blocking nonorientability of a surface. - Bojan Mohar; Alexander Schrijver (J. Comb. Theory B, 2003)

Circular colorings of edge-weighted graphs. - Bojan Mohar (J. Graph Theory, 2003)

Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9. - Bojan Mohar; Riste Skrekovski; Heinz-Jürgen Voss (J. Graph Theory, 2003)

Acyclic Homomorphisms and Circular Colorings of Digraphs. - Tomás Feder; Pavol Hell; Bojan Mohar (SIAM J. Discret. Math., 2003)

Hajós Theorem For Colorings Of Edge-Weighted Graphs. - Bojan Mohar (Comb., 2004)

Rigidity and separation indices of Paley graphs. - Gasper Fijavz; Bojan Mohar (Discret. Math., 2004)

Cubic inflation, mirror graphs, regular maps, and partial cubes. - Bostjan Bresar; Sandi Klavzar; Alenka Lipovec; Bojan Mohar (Eur. J. Comb., 2004)

A Spectral Approach to Graphical Representation of Data. - Drago Bokal; Martin Juvan; Bojan Mohar (Informatica (Slovenia), 2004)

Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs. - Thomas Böhme 001; Bojan Mohar; Riste Skrekovski; Michael Stiebitz (J. Graph Theory, 2004)

The circular chromatic number of a digraph. - Drago Bokal; Gasper Fijavz; Martin Juvan; P. Mark Kayll; Bojan Mohar (J. Graph Theory, 2004)

Homotopic spanners. - Sergio Cabello; Bojan Mohar; Arjana Zitnik (EuroCG, 2005)

Triangulations and the Hajós Conjecture. - Bojan Mohar (Electron. J. Comb., 2005)

2-restricted extensions of partial embeddings of graphs. - Martin Juvan; Bojan Mohar (Eur. J. Comb., 2005)

Foreword. - Bojan Mohar (Eur. J. Comb., 2005)

Acyclic colorings of locally planar graphs. - Bojan Mohar (Eur. J. Comb., 2005)

Crossing numbers of Sierpinski-like graphs. - Sandi Klavzar; Bojan Mohar (J. Graph Theory, 2005)

Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. - Ken-ichi Kawarabayashi; Bojan Mohar (STOC, 2006)

Universal obstructions for embedding extension problems. - Bojan Mohar (Australas. J Comb., 2006)

Graphs on Surfaces and Their Applications, by Sergei K. Lando and Alexander K. Zvonkin, Encyclopaedia of Mathematical Sciences 141, Springer-Verlag, 2004. - Bojan Mohar (Comb. Probab. Comput., 2006)

On Polyhedral Embeddings of Cubic Graphs. - Bojan Mohar; Andrej Vodopivec (Comb. Probab. Comput., 2006)

Bar-Magnet Polyhedra and NS-Orientations of Maps. - Bojan Mohar (Discret. Comput. Geom., 2006)

Small separations in vertex-transitive graphs. - Matt DeVos; Bojan Mohar (Electron. Notes Discret. Math., 2006)

Coloring Vertices and Faces of Locally Planar Graphs. - Michael O. Albertson; Bojan Mohar (Graphs Comb., 2006)

Expected Case for Projecting Points. - Sergio Cabello; Matt DeVos; Bojan Mohar (Informatica (Slovenia), 2006)

On the Crossing Number of Almost Planar Graphs. - Bojan Mohar (Informatica (Slovenia), 2006)

Tree amalgamation of graphs and tessellations of the Cantor sphere. - Bojan Mohar (J. Comb. Theory B, 2006)

The Minor Crossing Number. - Drago Bokal; Gasper Fijavz; Bojan Mohar (SIAM J. Discret. Math., 2006)

Obstructions for simple embeddings. - Martin Juvan; Joze Marincek; Bojan Mohar (Australas. J Comb., 2007)

Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs. - Sergio Cabello; Bojan Mohar (Discret. Comput. Geom., 2007)

Heuristic search for Hamilton cycles in cubic graphs. - Janez Ales; Bojan Mohar; Tomaz Pisanski (Discret. Math., 2007)

Preface. - Sandi Klavzar; Dragan Marusic; Bojan Mohar; Tomaz Pisanski (Discret. Math., 2007)

Research problems from the 5th Slovenian Conference (Bled, 2003). - Bojan Mohar; Richard J. Nowakowski; Douglas B. West (Discret. Math., 2007)

Labeling planar graphs with a condition at distance two. - Peter Bella; Daniel Král; Bojan Mohar; Katarína Quittnerová (Eur. J. Comb., 2007)

Some Recent Progress and Applications in Graph Minor Theory. - Ken-ichi Kawarabayashi; Bojan Mohar (Graphs Comb., 2007)

A relaxed Hadwiger's Conjecture for list colorings. - Ken-ichi Kawarabayashi; Bojan Mohar (J. Comb. Theory B, 2007)

Circular Coloring the Plane. - Matt DeVos; Javad B. Ebrahimi; Mohammad Ghebleh; Luis A. Goddyn; Bojan Mohar; Reza Naserasr (SIAM J. Discret. Math., 2007)

Improved upper bounds on the crossing number. - Vida Dujmovic; Ken-ichi Kawarabayashi; Bojan Mohar; David R. Wood (SCG, 2008)

A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width. - Ken-ichi Kawarabayashi; Bojan Mohar; Bruce A. Reed (FOCS, 2008)

Crossing and Weighted Crossing Number of Near-Planar Graphs. - Sergio Cabello; Bojan Mohar (GD, 2008)

Graph and map isomorphism and all polyhedral embeddings in linear time. - Ken-ichi Kawarabayashi; Bojan Mohar (STOC, 2008)

Relating embedding and coloring properties of snarks. - Bojan Mohar; Eckhard Steffen; Andrej Vodopivec (Ars Math. Contemp., 2008)

Coloring parameters for graphs on surfaces. - Bojan Mohar; Simon Spacapan (Electron. Notes Discret. Math., 2008)

Locally planar graphs are 5-choosable. - Matt DeVos; Ken-ichi Kawarabayashi; Bojan Mohar (J. Comb. Theory B, 2008)

List-color-critical graphs on a fixed surface. - Ken-ichi Kawarabayashi; Bojan Mohar (SODA, 2009)

The genus crossing number. - Bojan Mohar (Ars Math. Contemp., 2009)

Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (extended abstract). - Zdenek Dvorák 001; Bojan Mohar (Electron. Notes Discret. Math., 2009)

Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)] - Thomas Böhme 001; Ken-ichi Kawarabayashi; John Maharry; Bojan Mohar (J. Comb. Theory B, 2009)

Linear connectivity forces large complete bipartite minors. - Thomas Böhme 001; Ken-ichi Kawarabayashi; John Maharry; Bojan Mohar (J. Comb. Theory B, 2009)

Cayley sum graphs and eigenvalues of (3, 6)-fullerenes. - Matt DeVos; Luis A. Goddyn; Bojan Mohar; Robert Sámal (J. Comb. Theory B, 2009)

On the sum of k largest eigenvalues of graphs and symmetric matrices. - Bojan Mohar (J. Comb. Theory B, 2009)

The Two-Coloring Number and Degenerate Colorings of Planar Graphs. - Hal A. Kierstead; Bojan Mohar; Simon Spacapan; Daqing Yang; Xuding Zhu (SIAM J. Discret. Math., 2009)

Adding one edge to planar graphs makes crossing number hard. - Sergio Cabello; Bojan Mohar (SCG, 2010)

Linkless and flat embeddings in 3-space and the unknot problem. - Ken-ichi Kawarabayashi; Stephan Kreutzer; Bojan Mohar (SCG, 2010)

Do We Really Understand the Crossing Numbers? - Bojan Mohar (MFCS, 2010)

Immersing small complete graphs. - Matt DeVos; Ken-ichi Kawarabayashi; Bojan Mohar; Haruko Okamura (Ars Math. Contemp., 2010)

Approximation algorithms via contraction decomposition. - Erik D. Demaine; MohammadTaghi Hajiaghayi; Bojan Mohar (Comb., 2010)

An Eberhard-Like Theorem for Pentagons and Heptagons. - Matt DeVos; Agelos Georgakopoulos; Bojan Mohar; Robert Sámal (Discret. Comput. Geom., 2010)

Simplices and Spectra of Graphs. - Bojan Mohar; Igor Rivin (Discret. Comput. Geom., 2010)

Strong embeddings of minimum genus. - Bojan Mohar (Discret. Math., 2010)

Rigidity and Separation Indices of Graphs in Surfaces. - Gasper Fijavz; Bojan Mohar (Graphs Comb., 2010)

Crossing-critical graphs with large maximum degree. - Zdenek Dvorák 001; Bojan Mohar (J. Comb. Theory B, 2010)

Spectral radius of finite and infinite planar graphs and of graphs of bounded genus. - Zdenek Dvorák 001; Bojan Mohar (J. Comb. Theory B, 2010)

Star Coloring and Acyclic Coloring of Locally Planar Graphs. - Ken-ichi Kawarabayashi; Bojan Mohar (SIAM J. Discret. Math., 2010)

Finding one tight cycle. - Sergio Cabello; Matt DeVos; Jeff Erickson 001; Bojan Mohar (ACM Trans. Algorithms, 2010)

On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph. - Bojan Mohar; Petr Skoda 002 (IWOCA, 2011)

Crossing Number and Weighted Crossing Number of Near-Planar Graphs. - Sergio Cabello; Bojan Mohar (Algorithmica, 2011)

Toughness of Ka,t-Minor-Free Graphs. - Guantao Chen; Yoshimi Egawa; Ken-ichi Kawarabayashi; Bojan Mohar; Katsuhiro Ota (Electron. J. Comb., 2011)

Strengthened Brooks' Theorem for Digraphs of Girth at least Three. - Ararat Harutyunyan; Bojan Mohar (Electron. J. Comb., 2011)

Preface. - Gena Hahn; Bojan Mohar (Discret. Math., 2011)

Expected Crossing Numbers. - Bojan Mohar; Tamon Stephen (Electron. Notes Discret. Math., 2011)

Asymptotic enumeration and limit laws for graphs of fixed genus. - Guillaume Chapuy; Éric Fusy; Omer Giménez; Bojan Mohar; Marc Noy (J. Comb. Theory A, 2011)

Unexpected behaviour of crossing sequences. - Matt DeVos; Bojan Mohar; Robert Sámal (J. Comb. Theory B, 2011)

The genus of Petersen powers. - Bojan Mohar; Andrej Vodopivec (J. Graph Theory, 2011)

Gallai's Theorem for List Coloring of Digraphs. - Ararat Harutyunyan; Bojan Mohar (SIAM J. Discret. Math., 2011)

Linkless and Flat Embeddings in 3-Space. - Ken-ichi Kawarabayashi; Stephan Kreutzer; Bojan Mohar (Discret. Comput. Geom., 2012)

Two results on the digraph chromatic number. - Ararat Harutyunyan; Bojan Mohar (Discret. Math., 2012)

Immersing complete digraphs. - Matt DeVos; Jessica McDonald; Bojan Mohar; Diego Scheide (Eur. J. Comb., 2012)

Degenerate and star colorings of graphs on surfaces. - Bojan Mohar; Simon Spacapan (Eur. J. Comb., 2012)

Coloring Eulerian Triangulations of the Klein Bottle. - Daniel Král'; Bojan Mohar; Atsuhiro Nakamoto; Ondrej Pangrác; Yusuke Suzuki (Graphs Comb., 2012)

Spectrally degenerate graphs: Hereditary case. - Zdenek Dvorák 001; Bojan Mohar (J. Comb. Theory B, 2012)

Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph. - Bojan Mohar; Petr Skoda 002 (J. Graph Algorithms Appl., 2012)

Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs. - Jessica McDonald; Bojan Mohar; Diego Scheide (J. Graph Theory, 2012)

Planar Graphs Have Exponentially Many 3-Arboricities. - Ararat Harutyunyan; Bojan Mohar (SIAM J. Discret. Math., 2012)

The excluded minor structure theorem with planarly embedded wall. - Bojan Mohar (Ars Math. Contemp., 2013)

Chromatic number and complete graph substructures for degree sequences. - Zdenek Dvorák 001; Bojan Mohar (Comb., 2013)

Local chromatic number of quadrangulations of surfaces. - Bojan Mohar; Gábor Simonyi; Gábor Tardos (Comb., 2013)

Integral Cayley Multigraphs over Abelian and Hamiltonian Groups. - Matt DeVos; Roi Krakovski; Bojan Mohar; Azhvan Sheikh Ahmady (Electron. J. Comb., 2013)

A Note on Forbidding Clique Immersions. - Matt DeVos; Jessica McDonald; Bojan Mohar; Diego Scheide (Electron. J. Comb., 2013)

Many large eigenvalues in sparse graphs. - Bojan Mohar (Eur. J. Comb., 2013)

Star Chromatic Index. - Zdenek Dvorák 001; Bojan Mohar; Robert Sámal (J. Graph Theory, 2013)

Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing. - Vladimir P. Korzhik; Bojan Mohar (J. Graph Theory, 2013)

Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard. - Sergio Cabello; Bojan Mohar (SIAM J. Comput., 2013)

Digraph Girth via Chromatic Number. - Peter Keevash; Zhentao Li; Bojan Mohar; Bruce A. Reed (SIAM J. Discret. Math., 2013)

Ordering without Forbidden Patterns. - Pavol Hell; Bojan Mohar; Arash Rafiey (ESA, 2014)

A minimum degree condition forcing complete graph immersion. - Matt DeVos; Zdenek Dvorák 001; Jacob Fox; Jessica McDonald; Bojan Mohar; Diego Scheide (Comb., 2014)

Integral Cayley Graphs and Groups. - Azhvan Sheikh Ahmady; Jason P. Bell; Bojan Mohar (SIAM J. Discret. Math., 2014)

Packing Triangles in Weighted Graphs. - Guillaume Chapuy; Matt DeVos; Jessica McDonald; Bojan Mohar; Diego Scheide (SIAM J. Discret. Math., 2014)

Homological Face-Width Condition Forcing K6-Minors in Graphs on Surfaces. - Roi Krakovski; Bojan Mohar (SIAM J. Discret. Math., 2014)

Four terminal planar Delta-Wye reducibility via rooted K2, 4 minors. - Lino Demasi; Bojan Mohar (SODA, 2015)

Highly arc-transitive digraphs - Structure and counterexamples. - Matt DeVos; Bojan Mohar; Robert Sámal (Comb., 2015)

Corrigendum to "Many large eigenvalues in sparse graphs" [European J. Combin. 34(2013) 1125-1129]. - Bojan Mohar (Eur. J. Comb., 2015)

Drawing a disconnected graph on the torus (Extended abstract). - Sergio Cabello; Bojan Mohar; Robert Sámal (Electron. Notes Discret. Math., 2015)

Triangle-free subgraphs with large fractional chromatic number. - Bojan Mohar; Hehui Wu (Electron. Notes Discret. Math., 2015)

Median eigenvalues and the HOMO-LUMO index of graphs. - Bojan Mohar (J. Comb. Theory B, 2015)

Weak duality for packing edge-disjoint odd (u, v)-trails. - Ross Churchley; Bojan Mohar; Hehui Wu (SODA, 2016)

Planar digraphs of digirth four are 2-colourable. - Zhentao Li; Bojan Mohar (CoRR, 2016)

Median Eigenvalues of Bipartite Subcubic Graphs. - Bojan Mohar (Comb. Probab. Comput., 2016)

Editorial. - Michael Krivelevich; Bojan Mohar (J. Comb. Theory B, 2016)

Crossing Numbers of Periodic Graphs. - Zdenek Dvorák 001; Bojan Mohar (J. Graph Theory, 2016)

Interval Minors of Complete Bipartite Graphs. - Bojan Mohar; Arash Rafiey; Behruz Tayfeh-Rezaie; Hehui Wu (J. Graph Theory, 2016)

Graphic TSP in Cubic Graphs. - Zdenek Dvorák 001; Daniel Král; Bojan Mohar (STACS, 2017)

Embedding quartic Eulerian digraphs on the plane. - Dan Archdeacon; C. Paul Bonnington; Bojan Mohar (Australas. J Comb., 2017)

Whitney's theorem for 2-regular planar digraphs. - Dan Archdeacon; Matt DeVos; Stefan Hannie; Bojan Mohar (Australas. J Comb., 2017)

Dan Archdeacon (11 May 1954 to 18 February 2015). - Drago Bokal; Bojan Mohar; Jozef Sirán (Ars Math. Contemp., 2017)

Topological directions in Cops and Robbers. - Anthony Bonato; Bojan Mohar (CoRR, 2017)

Almost all regular graphs are normal. - Seyed Saeed Changiz Rezaei; Seyyed Aliasghar Hosseini; Bojan Mohar (Discret. Appl. Math., 2017)

Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths. - Krystal Guo; Bojan Mohar (Discret. Math., 2017)

Obstructions for two-vertex alternating embeddings of graphs in surfaces. - Bojan Mohar; Petr Skoda 002 (Eur. J. Comb., 2017)

Exponentially many nowhere-zero ℝ3-, ℝ4-, and ℝ6-flows. - Zdenek Dvorák 001; Bojan Mohar; Robert Sámal (Electron. Notes Discret. Math., 2017)

Proper Orientations of Planar Bipartite Graphs. - Fiachra Knox; Naoki Matsumoto; Sebastián González Hermosillo de la Maza; Bojan Mohar; Cláudia Linhares Sales (Graphs Comb., 2017)

5-choosability of graphs with crossings far apart. - Zdenek Dvorák 001; Bernard Lidický; Bojan Mohar (J. Comb. Theory B, 2017)

5-list-coloring planar graphs with distant precolored vertices. - Zdenek Dvorák 001; Bernard Lidický; Bojan Mohar; Luke Postle (J. Comb. Theory B, 2017)

Hermitian Adjacency Matrix of Digraphs and Mixed Graphs. - Krystal Guo; Bojan Mohar (J. Graph Theory, 2017)

Planar Digraphs of Digirth Five Are 2-Colorable. - Ararat Harutyunyan; Bojan Mohar (J. Graph Theory, 2017)

Planar Digraphs of Digirth Four are 2-Colorable. - Zhentao Li; Bojan Mohar (SIAM J. Discret. Math., 2017)

Structure and Generation of Crossing-Critical Graphs. - Zdenek Dvorák 001; Petr Hlinený; Bojan Mohar (SoCG, 2018)

A submodular measure and approximate Gomory-Hu theorem for packing odd trails. - Ross Churchley; Bojan Mohar (SODA, 2018)

Minimal Normal Graph Covers. - David Gajser; Bojan Mohar (Comb., 2018)

Short rainbow cycles in sparse graphs. - Matt DeVos; Sebastián González Hermosillo de la Maza; Krystal Guo; Daryl Funk; Tony Huynh; Bojan Mohar; Amanda Montejano (CoRR, 2018)

Tight Upper Bounds on the Crossing Number in a Minor-Closed Class. - Vida Dujmovic; Ken-ichi Kawarabayashi; Bojan Mohar; David R. Wood (CoRR, 2018)

The inverse Voronoi problem in graphs. - Édouard Bonnet; Sergio Cabello; Bojan Mohar; Hebert Pérez-Rosés (CoRR, 2018)

Game of cops and robbers in oriented quotients of the integer grid. - Seyyed Aliasghar Hosseini; Bojan Mohar (Discret. Math., 2018)

Finding a subdivision of a prescribed digraph of order 4. - Frédéric Havet; Ana Karolinna Maia; Bojan Mohar (J. Graph Theory, 2018)

Grünbaum colorings of even triangulations on surfaces. - Michal Kotrbcík; Naoki Matsumoto; Bojan Mohar; Atsuhiro Nakamoto; Kenta Noguchi; Kenta Ozeki; Andrej Vodopivec (J. Graph Theory, 2018)

Bishellable drawings of Kn. - Bernardo M. Ábrego; Oswin Aichholzer; Silvia Fernández-Merchant; Dan McQuillan; Bojan Mohar; Petra Mutzel; Pedro Ramos 001; R. Bruce Richter; Birgit Vogtenhuber (SIAM J. Discret. Math., 2018)

The Crossing Number of the Cone of a Graph. - Carlos A. Alfaro; Alan Arroyo; Marek Dernár; Bojan Mohar (SIAM J. Discret. Math., 2018)

Exponentially Many Nowhere-Zero ℤ3-, ℤ4-, and ℤ6-Flows. - Zdenek Dvorák 001; Bojan Mohar; Robert Sámal (Comb., 2019)

Maximum Number of Colourings: 5-Chromatic Case. - Fiachra Knox; Bojan Mohar (Electron. J. Comb., 2019)

Fractional Decompositions and the Smallest-eigenvalue Separation. - Fiachra Knox; Bojan Mohar (Electron. J. Comb., 2019)

Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12. - Drago Bokal; Zdenek Dvorák 001; Petr Hlinený; Jesús Leaños; Bojan Mohar; Tilo Wiedera (CoRR, 2019)

The sandpile group of a polygon flower. - Haiyan Chen; Bojan Mohar (Discret. Appl. Math., 2019)

A Golden Ratio Inequality for Vertex Degrees of Graphs. - Fiachra Knox; Bojan Mohar; David R. Wood (Am. Math. Mon., 2019)

Limiting Crossing Numbers for Geodesic Drawings on the Sphere. - Marthe Bonamy; Bojan Mohar; Alexandra Wesolek (GD, 2020)

The Inverse Voronoi Problem in Graphs I: Hardness. - Édouard Bonnet; Sergio Cabello; Bojan Mohar; Hebert Pérez-Rosés (Algorithmica, 2020)

Automorphism groups of maps in linear time. - Ken-ichi Kawarabayashi; Bojan Mohar; Roman Nedela; Peter Zeman 001 (CoRR, 2020)

Guest Editors' Foreword. - Gil Kalai; Bojan Mohar; Isabella Novik (Discret. Comput. Geom., 2020)

The genus of complete 3-uniform hypergraphs. - Yifan Jing; Bojan Mohar (J. Comb. Theory B, 2020)

Maximum number of colourings: 4-chromatic graphs. - Fiachra Knox; Bojan Mohar (J. Comb. Theory B, 2020)

Ron Graham (1935-2020). - Michael Krivelevich; Bojan Mohar (J. Comb. Theory B, 2020)

Fractional chromatic number of a random subgraph. - Bojan Mohar; Hehui Wu (J. Graph Theory, 2020)

Cops and Robbers on Graphs of Bounded Diameter. - Seyyed Aliasghar Hosseini; Fiachra Knox; Bojan Mohar (SIAM J. Discret. Math., 2020)

The Inverse Voronoi Problem in Graphs II: Trees. - Édouard Bonnet; Sergio Cabello; Bojan Mohar; Hebert Pérez-Rosés (Algorithmica, 2021)

Random 2-cell embeddings of multistars. - Jesse Campion Loth; Kevin Halasz; Tomás Masarík; Bojan Mohar; Robert Sámal (CoRR, 2021)

Reflexive coloring complexes for 3-edge-colorings of cubic graphs. - Fiachra Knox; Bojan Mohar; Nathan Singer (Discret. Math., 2021)

The last temptation of William T. Tutte. - Bojan Mohar; Nathan Singer (Eur. J. Comb., 2021)

Short rainbow cycles in graphs and matroids. - Matt DeVos; Matthew Drescher; Daryl Funk; Sebastián González Hermosillo de la Maza; Krystal Guo; Tony Huynh; Bojan Mohar; Amanda Montejano (J. Graph Theory, 2021)

Meyniel's conjecture on graphs of bounded degree. - Seyyed Aliasghar Hosseini; Bojan Mohar; Sebastián González Hermosillo de la Maza (J. Graph Theory, 2021)

Cops and robbers on oriented toroidal grids. - Sebastián González Hermosillo de la Maza; Seyyed Aliasghar Hosseini; Fiachra Knox; Bojan Mohar; Bruce A. Reed (Theor. Comput. Sci., 2021)

Embedding Graphs into Two-Dimensional Simplicial Complexes. - Éric Colin de Verdière; Thomas Magnard; Bojan Mohar (Comput. Geom. Topol., 2022)

Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12. - Drago Bokal; Zdenek Dvorák 001; Petr Hlinený; Jesús Leaños; Bojan Mohar; Tilo Wiedera (Comb., 2022)

Inducibility and universality for trees. - Timothy F. N. Chan; Daniel Král'; Bojan Mohar; David R. Wood (Comb. Theory, 2022)

The Sandpile Group of Polygon Rings and Twisted Polygon Rings. - Haiyan Chen; Bojan Mohar (Graphs Comb., 2022)

The evolution of the structure of ABC-minimal trees. - Seyyed Aliasghar Hosseini; Bojan Mohar; Mohammad Bagher Ahmadi (J. Comb. Theory B, 2022)

Subgraphs of Kneser graphs with large girth and large chromatic number. - Bojan Mohar; Hehui Wu (Art Discret. Appl. Math., 2022)

Graphs of Linear Growth have Bounded Treewidth. - Rutger Campbell; Marc Distel; J. Pascal Gollin; Daniel J. Harvey; Kevin Hendrey; Robert Hickingbotham; Bojan Mohar; David R. Wood (Electron. J. Comb., 2023)

Expected number of faces in a random embedding of any graph is at most linear. - Jesse Campion Loth; Bojan Mohar (Comb. Probab. Comput., 2023)

Robin Thomas (1962-2020). - Michael Krivelevich; Bojan Mohar (J. Comb. Theory B, 2023)

On the cop number of graphs of high girth. - Peter Bradshaw; Seyyed Aliasghar Hosseini; Bojan Mohar; Ladislav Stacho (J. Graph Theory, 2023)

On Density of ( boldsymbol{ mathbb{Z}_3} ) -Flow-Critical Graphs. - Zdenek Dvorák 001; Bojan Mohar (SIAM J. Discret. Math., 2023)

Proper orientations and proper chromatic number. - Yaobin Chen; Bojan Mohar; Hehui Wu (J. Comb. Theory B, 2023)

Three-Edge-Coloring Projective Planar Cubic Graphs: A Generalization of the Four Color Theorem. - Yuta Inoue; Ken-ichi Kawarabayashi; Atsuyuki Miyashita; Bojan Mohar; Tomohiro Sonobe (FOCS, 2024)

Exact Algorithms for Clustered Planarity with Linear Saturators. - Giordano Da Lozzo; Robert Ganian; Siddharth Gupta 002; Bojan Mohar; Sebastian Ordyniak; Meirav Zehavi (ISAAC, 2024)

Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic. - Jesse Campion Loth; Kevin Halasz; Tomás Masarík; Bojan Mohar; Robert Sámal (SODA, 2024)

Cops and Robber on Hyperbolic Manifolds. - Vesna Irsic; Bojan Mohar; Alexandra Wesolek (CoRR, 2024)

Guarding isometric subgraphs and cops and robber in planar graphs. - Sebastián González Hermosillo de la Maza; Bojan Mohar (Eur. J. Comb., 2024)

Excluded minors for the Klein bottle II. Cascades. - Bojan Mohar; Petr Skoda 002 (J. Comb. Theory B, 2024)

Excluded minors for the Klein bottle I. Low connectivity case. - Bojan Mohar; Petr Skoda 002 (J. Comb. Theory B, 2024)

Treewidth, Circle Graphs, and Circular Drawings. - Robert Hickingbotham; Freddie Illingworth; Bojan Mohar; David R. Wood (SIAM J. Discret. Math., 2024)

List-Avoiding Orientations. - Peter Bradshaw; Yaobin Chen; Hao Ma; Bojan Mohar; Hehui Wu (Comb., 2024)

Efficient polynomial-time approximation scheme for the genus of dense graphs. - Yifan Jing; Bojan Mohar (J. ACM, 2024)

Clustered Colouring of Graph Products. - Rutger Campbell; J. Pascal Gollin; Kevin Hendrey; Thomas Lesgourgues; Bojan Mohar; Youri Tamitegama; Jane Tan; David R. Wood (Electron. J. Comb., 2025)

Automorphisms and Isomorphisms of Maps in Linear Time. - Ken-ichi Kawarabayashi; Bojan Mohar; Roman Nedela; Peter Zeman 001 (ACM Trans. Algorithms, 2025)