| 2013 | ||
|---|---|---|
| j154 | ||
| j153 | Vladimir P. Korzhik, Bojan Mohar: Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing. Journal of Graph Theory 72(1): 30-71 (2013) | |
| j152 | Zdenek Dvorak, Bojan Mohar, Robert Sámal: Star Chromatic Index. Journal of Graph Theory 72(3): 313-326 (2013) | |
| 2012 | ||
| j151 | Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar: Linkless and Flat Embeddings in 3-Space. Discrete & Computational Geometry 47(4): 731-755 (2012) | |
| j150 | Ararat Harutyunyan, Bojan Mohar: Two results on the digraph chromatic number. Discrete Mathematics 312(10): 1823-1826 (2012) | |
| j149 | Bojan Mohar, Simon Spacapan: Degenerate and star colorings of graphs on surfaces. Eur. J. Comb. 33(3): 340-349 (2012) | |
| j148 | Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide: Immersing complete digraphs. Eur. J. Comb. 33(6): 1294-1302 (2012) | |
| j147 | Daniel Král', Bojan Mohar, Atsuhiro Nakamoto, Ondrej Pangrác, Yusuke Suzuki: Coloring Eulerian Triangulations of the Klein Bottle. Graphs and Combinatorics 28(4): 499-530 (2012) | |
| j146 | Zdenek Dvorak, Bojan Mohar: Spectrally degenerate graphs: Hereditary case. J. Comb. Theory, Ser. B 102(5): 1099-1109 (2012) | |
| j145 | 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) | |
| j144 | Jessica McDonald, Bojan Mohar, Diego Scheide: Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs. Journal of Graph Theory 70(2): 226-239 (2012) | |
| j143 | Ararat Harutyunyan, Bojan Mohar: Planar Graphs Have Exponentially Many 3-Arboricities. SIAM J. Discrete 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 Dvorak, Bernard Lidický, Bojan Mohar, Luke Postle: 5-list-coloring planar graphs with distant precolored vertices. CoRR abs/1209.0366 (2012) | |
| 2011 | ||
| j142 | Sergio Cabello, Bojan Mohar: Crossing Number and Weighted Crossing Number of Near-Planar Graphs. Algorithmica 60(3): 484-504 (2011) | |
| j141 | Guantao Chen, Yoshimi Egawa, Ken-ichi Kawarabayashi, Bojan Mohar, Katsuhiro Ota: Toughness of Ka,t-Minor-Free Graphs. Electr. J. Comb. 18(1) (2011) | |
| j140 | Ararat Harutyunyan, Bojan Mohar: Strengthened Brooks' Theorem for Digraphs of Girth at least Three. Electr. J. Comb. 18(1) (2011) | |
| j139 | ||
| j138 | Bojan Mohar, Tamon Stephen: Expected Crossing Numbers. Electronic Notes in Discrete Mathematics 38: 651-656 (2011) | |
| j137 | Matt DeVos, Bojan Mohar, Robert Sámal: Unexpected behaviour of crossing sequences. J. Comb. Theory, Ser. B 101(6): 448-463 (2011) | |
| j136 | Guillaume Chapuy, Éric Fusy, Omer Giménez, Bojan Mohar, Marc Noy: Asymptotic enumeration and limit laws for graphs of fixed genus. J. Comb. Theory, Ser. A 118(3): 748-777 (2011) | |
| j135 | Bojan Mohar, Andrej Vodopivec: The genus of Petersen powers. Journal of Graph Theory 67(1): 1-8 (2011) | |
| j134 | Ararat Harutyunyan, Bojan Mohar: Gallai's Theorem for List Coloring of Digraphs. SIAM J. Discrete Math. 25(1): 170-180 (2011) | |
| c19 | Bojan Mohar, Petr Skoda: On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph. IWOCA 2011: 300-309 | |
| 2010 | ||
| j133 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar: Approximation algorithms via contraction decomposition. Combinatorica 30(5): 533-552 (2010) | |
| j132 | Bojan Mohar, Igor Rivin: Simplices and Spectra of Graphs. Discrete & Computational Geometry 43(3): 516-521 (2010) | |
| j131 | Matt DeVos, Agelos Georgakopoulos, Bojan Mohar, Robert Sámal: An Eberhard-Like Theorem for Pentagons and Heptagons. Discrete & Computational Geometry 44(4): 931-945 (2010) | |
| j130 | Sandi Klavzar, Dragan Marusic, Bojan Mohar, Tomaz Pisanski: Preface. Discrete Mathematics 310(12): 1651-1652 (2010) | |
| j129 | ||
| j128 | Gasper Fijavz, Bojan Mohar: Rigidity and Separation Indices of Graphs in Surfaces. Graphs and Combinatorics 26(4): 491-498 (2010) | |
| j127 | Zdenek Dvorak, Bojan Mohar: Crossing-critical graphs with large maximum degree. J. Comb. Theory, Ser. B 100(4): 413-417 (2010) | |
| j126 | Zdenek Dvorak, Bojan Mohar: Spectral radius of finite and infinite planar graphs and of graphs of bounded genus. J. Comb. Theory, Ser. B 100(6): 729-739 (2010) | |
| j125 | Ken-ichi Kawarabayashi, Bojan Mohar: Star Coloring and Acyclic Coloring of Locally Planar Graphs. SIAM J. Discrete Math. 24(1): 56-71 (2010) | |
| j124 | Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar: Finding one tight cycle. ACM Transactions on Algorithms 6(4) (2010) | |
| c18 | Sergio Cabello, Bojan Mohar: Adding one edge to planar graphs makes crossing number hard. Symposium on Computational Geometry 2010: 68-76 | |
| c17 | Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar: Linkless and flat embeddings in 3-space and the unknot problem. Symposium on Computational Geometry 2010: 97-106 | |
| c16 | ||
| i2 | Zdenek Dvorak, Bojan Mohar: Spectrally degenerate graphs: Hereditary case. CoRR abs/1010.3367 (2010) | |
| 2009 | ||
| j123 | Zdenek Dvorak, Bojan Mohar: Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (extended abstract). Electronic Notes in Discrete Mathematics 34: 101-105 (2009) | |
| j122 | Bojan Mohar: On the sum of k largest eigenvalues of graphs and symmetric matrices. J. Comb. Theory, Ser. B 99(2): 306-313 (2009) | |
| j121 | 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, Ser. B 99(2): 323 (2009) | |
| j120 | Matt DeVos, Luis A. Goddyn, Bojan Mohar, Robert Sámal: Cayley sum graphs and eigenvalues of (3, 6)-fullerenes. J. Comb. Theory, Ser. B 99(2): 358-369 (2009) | |
| j119 | Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar: Linear connectivity forces large complete bipartite minors. J. Comb. Theory, Ser. B 99(3): 557-582 (2009) | |
| j118 | Hal A. Kierstead, Bojan Mohar, Simon Spacapan, Daqing Yang, Xuding Zhu: The Two-Coloring Number and Degenerate Colorings of Planar Graphs. SIAM J. Discrete Math. 23(3): 1548-1560 (2009) | |
| c15 | Ken-ichi Kawarabayashi, Bojan Mohar: List-color-critical graphs on a fixed surface. SODA 2009: 1156-1165 | |
| 2008 | ||
| j117 | Matt DeVos, Bojan Mohar, Robert Sámal: Unexpected behaviour of crossing sequences. Electronic Notes in Discrete Mathematics 31: 259-264 (2008) | |
| j116 | Bojan Mohar, Simon Spacapan: Coloring parameters for graphs on surfaces. Electronic Notes in Discrete Mathematics 31: 281-286 (2008) | |
| j115 | Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar: Locally planar graphs are 5-choosable. J. Comb. Theory, Ser. B 98(6): 1215-1232 (2008) | |
| c14 | Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood: Improved upper bounds on the crossing number. Symposium on Computational Geometry 2008: 375-384 | |
| c13 | 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 | |
| c12 | Sergio Cabello, Bojan Mohar: Crossing and Weighted Crossing Number of Near-Planar Graphs. Graph Drawing 2008: 38-49 | |
| c11 | Vladimir P. Korzhik, Bojan Mohar: Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing. Graph Drawing 2008: 302-312 | |
| c10 | ||
| c9 | Ken-ichi Kawarabayashi, Bojan Mohar: Graph and map isomorphism and all polyhedral embeddings in linear time. STOC 2008: 471-480 | |
| 2007 | ||
| j114 | Sergio Cabello, Bojan Mohar: Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs. Discrete & Computational Geometry 37(2): 213-235 (2007) | |
| j113 | Sandi Klavzar, Dragan Marusic, Bojan Mohar, Tomaz Pisanski: Preface. Discrete Mathematics 307(3-5): 299 (2007) | |
| j112 | Janez Ales, Bojan Mohar, Tomaz Pisanski: Heuristic search for Hamilton cycles in cubic graphs. Discrete Mathematics 307(3-5): 303-309 (2007) | |
| j111 | Bojan Mohar, Richard J. Nowakowski, Douglas B. West: Research problems from the 5th Slovenian Conference (Bled, 2003). Discrete Mathematics 307(3-5): 650-658 (2007) | |
| j110 | 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) | |
| j109 | Ken-ichi Kawarabayashi, Bojan Mohar: Some Recent Progress and Applications in Graph Minor Theory. Graphs and Combinatorics 23(1): 1-46 (2007) | |
| j108 | Ken-ichi Kawarabayashi, Bojan Mohar: A relaxed Hadwiger's Conjecture for list colorings. J. Comb. Theory, Ser. B 97(4): 647-651 (2007) | |
| j107 | Matt DeVos, Javad Ebrahimi, Mohammad Ghebleh, Luis A. Goddyn, Bojan Mohar, Reza Naserasr: Circular Coloring the Plane. SIAM J. Discrete Math. 21(2): 461-465 (2007) | |
| c8 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Bojan Mohar: Approximation algorithms via contraction decomposition. SODA 2007: 278-287 | |
| 2006 | ||
| j106 | Bojan Mohar, Andrej Vodopivec: On Polyhedral Embeddings of Cubic Graphs. Combinatorics, Probability & Computing 15(6): 877-893 (2006) | |
| j105 | Bojan Mohar: Graphs on Surfaces and Their Applications, by Sergei K. Lando and Alexander K. Zvonkin, Encyclopaedia of Mathematical Sciences 141, Springer-Verlag, 2004. Combinatorics, Probability & Computing 15(6): 939-941 (2006) | |
| j104 | Bojan Mohar: Bar-Magnet Polyhedra and NS-Orientations of Maps. Discrete & Computational Geometry 35(3): 481-491 (2006) | |
| j103 | Matt DeVos, Bojan Mohar: Small separations in vertex-transitive graphs. Electronic Notes in Discrete Mathematics 24: 165-172 (2006) | |
| j102 | Michael O. Albertson, Bojan Mohar: Coloring Vertices and Faces of Locally Planar Graphs. Graphs and Combinatorics 22(3): 289-295 (2006) | |
| j101 | Sergio Cabello, Matt DeVos, Bojan Mohar: Expected Case for Projecting Points. Informatica (Slovenia) 30(3): 289-293 (2006) | |
| j100 | Bojan Mohar: On the Crossing Number of Almost Planar Graphs. Informatica (Slovenia) 30(3): 301-303 (2006) | |
| j99 | Bojan Mohar: Tree amalgamation of graphs and tessellations of the Cantor sphere. J. Comb. Theory, Ser. B 96(5): 740-753 (2006) | |
| j98 | Drago Bokal, Gasper Fijavz, Bojan Mohar: The Minor Crossing Number. SIAM J. Discrete Math. 20(2): 344-356 (2006) | |
| c7 | 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 | ||
| j97 | ||
| j96 | ||
| j95 | Martin Juvan, Bojan Mohar: 2-restricted extensions of partial embeddings of graphs. Eur. J. Comb. 26(3-4): 339-375 (2005) | |
| j94 | ||
| j93 | Sandi Klavzar, Bojan Mohar: Crossing numbers of Sierpinski-like graphs. Journal of Graph Theory 50(3): 186-198 (2005) | |
| c6 | Sergio Cabello, Bojan Mohar: Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs. ESA 2005: 131-142 | |
| i1 | ||
| 2004 | ||
| j92 | ||
| j91 | Gasper Fijavz, Bojan Mohar: Rigidity and separation indices of Paley graphs. Discrete Mathematics 289(1-3): 157-161 (2004) | |
| j90 | 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) | |
| j89 | ||
| j88 | Thomas Böhme, Bojan Mohar, Riste Skrekovski, Michael Stiebitz: Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs. Journal of Graph Theory 45(4): 270-274 (2004) | |
| j87 | Drago Bokal, Gasper Fijavz, Martin Juvan, P. Mark Kayll, Bojan Mohar: The circular chromatic number of a digraph. Journal of Graph Theory 46(3): 227-240 (2004) | |
| 2003 | ||
| j86 | Gasper Fijavz, Bojan Mohar: K6-Minors in Projective Planar Graphs. Combinatorica 23(3): 453-465 (2003) | |
| j85 | ||
| j84 | Sylvain Gravier, Frédéric Maffray, Bojan Mohar: On a list-coloring problem. Discrete Mathematics 268(1-3): 303-308 (2003) | |
| j83 | Sandi Klavzar, Bojan Mohar, Tomaz Pisanski, Norbert Seifter, Janez Zerovnik: Preface. Discussiones Mathematicae Graph Theory 23(2): 205 (2003) | |
| j82 | Scott Jones, P. Mark Kayll, Bojan Mohar, Walter D. Wallis: On constant-weight TSP-tours. Discussiones Mathematicae Graph Theory 23(2): 287-307 (2003) | |
| j81 | Bojan Mohar, Alexander Schrijver: Blocking nonorientability of a surface. J. Comb. Theory, Ser. B 87(1): 2-16 (2003) | |
| j80 | Bojan Mohar: Circular colorings of edge-weighted graphs. Journal of Graph Theory 43(2): 107-116 (2003) | |
| j79 | Bojan Mohar, Riste Skrekovski, Heinz-Jürgen Voss: Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9. Journal of Graph Theory 44(4): 261-295 (2003) | |
| j78 | Tomás Feder, Pavol Hell, Bojan Mohar: Acyclic Homomorphisms and Circular Colorings of Digraphs. SIAM J. Discrete Math. 17(1): 161-169 (2003) | |
| 2002 | ||
| j77 | Noga Alon, Bojan Mohar: The Chromatic Number Of Graph Powers. Combinatorics, Probability & Computing 11(1): 1-10 (2002) | |
| j76 | ||
| j75 | Joze Marincek, Bojan Mohar: On approximating the maximum diameter ratio of graphs. Discrete Mathematics 244(1-3): 323-330 (2002) | |
| j74 | Bojan Mohar: Coloring Eulerian triangulations of the projective plane. Discrete Mathematics 244(1-3): 339-343 (2002) | |
| j73 | Gasper Fijavz, Martin Juvan, Bojan Mohar, Riste Skrekovski: Planar Graphs Without Cycles of Specific Lengths. Eur. J. Comb. 23(4): 377-388 (2002) | |
| j72 | Thomas Böhme, Bojan Mohar: Labeled K2, t Minors in Plane Graphs. J. Comb. Theory, Ser. B 84(2): 291-300 (2002) | |
| j71 | Bojan Mohar, Paul D. Seymour: Coloring Locally Bipartite Graphs on Surfaces. J. Comb. Theory, Ser. B 84(2): 301-310 (2002) | |
| j70 | Thomas Böhme, Bojan Mohar, Carsten Thomassen: Long Cycles in Graphs on a Fixed Surface. J. Comb. Theory, Ser. B 85(2): 338-347 (2002) | |
| j69 | Thomas Böhme, John Maharry, Bojan Mohar: Ka, k Minors in Graphs of Bounded Tree-Width. J. Comb. Theory, Ser. 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 | |
| j68 | ||
| j67 | ||
| j66 | Simone Dantas, Sylvain Gravier, Frédéric Maffray, Bojan Mohar: Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum. Electronic Notes in Discrete Mathematics 7: 22-25 (2001) | |
| j65 | Bojan Mohar: Face Covers and the Genus Problem for Apex Graphs. J. Comb. Theory, Ser. B 82(1): 102-117 (2001) | |
| j64 | Bojan Mohar, Neil Robertson: Flexibility of Polyhedral Embeddings of Graphs in Surfaces. J. Comb. Theory, Ser. B 83(1): 38-57 (2001) | |
| 2000 | ||
| j63 | Bojan Mohar: Some Topological Methods in Graph Coloring Theory. Electronic Notes in Discrete Mathematics 5: 231-234 (2000) | |
| j62 | Bojan Mohar: Light paths in 4-connected graphs in the plane and other surfaces. Journal of Graph Theory 34(2): 170-179 (2000) | |
| 1999 | ||
| j61 | Martin Juvan, Bojan Mohar, Robin Thomas: List Edge-Colorings of Series-Parallel Graphs. Electr. J. Comb. 6 (1999) | |
| j60 | Bojan Mohar, Riste Skrekovski: The Grötzsch Theorem for the Hypergraph of Maximal Cliques. Electr. J. Comb. 6 (1999) | |
| j59 | Martin Juvan, Bojan Mohar, Riste Skrekovski: Graphs of degree 4 are 5-edge-choosable. Journal of Graph Theory 32(3): 250-264 (1999) | |
| j58 | Thomas Böhme, Bojan Mohar, Michael Stiebitz: Dirac's map-color theorem for choosability. Journal of Graph Theory 32(4): 327-339 (1999) | |
| j57 | Bojan Mohar: A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface. SIAM J. Discrete Math. 12(1): 6-26 (1999) | |
| c5 | ||
| 1998 | ||
| j56 | Dan Archdeacon, Nora Hartsfield, C. H. C. Little, Bojan Mohar: Obstruction Sets for Outer-Projective-Planar Graphs. Ars Comb. 49 (1998) | |
| j55 | Martin Juvan, Bojan Mohar, Riste Skrekovski: List Total Colourings of Graphs. Combinatorics, Probability & Computing 7(2): 181-188 (1998) | |
| j54 | Bojan Mohar, Pierre Rosenstiehl: Tessellation and Visibility Representations of Maps on the Torus. Discrete & Computational Geometry 19(2): 249-263 (1998) | |
| j53 | ||
| j52 | Bojan Mohar: On the orientable genus of graphs with bounded nonorientable genus. Discrete Mathematics 182(1-3): 245-253 (1998) | |
| j51 | D. Klabjan, Bojan Mohar: The number of matchings of low order in hexagonal systems. Discrete Mathematics 186(1-3): 167-175 (1998) | |
| j50 | Martin Juvan, Bojan Mohar, Riste Skrekovski: On list edge-colorings of subcubic graphs. Discrete Mathematics 187(1-3): 137-149 (1998) | |
| 1997 | ||
| j49 | ||
| j48 | Martin Juvan, Bojan Mohar, Janez Zerovnik: Distance-related Invariants on Polygraphs. Discrete Applied Mathematics 80(1): 57-71 (1997) | |
| j47 | Bojan Mohar: Apex graphs with embeddings of face-width three. Discrete Mathematics 176(1-3): 203-210 (1997) | |
| j46 | ||
| j45 | ||
| j44 | Martin Juvan, Bojan Mohar: Obstructions For 2-Möbius Band Embedding Extension Problem. SIAM J. Discrete Math. 10(1): 57-72 (1997) | |
| 1996 | ||
| j43 | Bojan Mohar, Neil Robertson, Richard P. Vitray: Planar graphs on the projective plane. Discrete Mathematics 149(1-3): 141-157 (1996) | |
| j42 | Bojan Mohar: Straight-line representations of maps on the torus and other flat surfaces. Discrete Mathematics 155(1-3): 173-181 (1996) | |
| j41 | Ivan Gutman, Bojan Mohar: The Quasi-Wiener and the Kirchhoff Indices Coincide. Journal of Chemical Information and Computer Sciences 36(5): 982-985 (1996) | |
| j40 | Richard Brunet, Bojan Mohar, R. Bruce Richter: Separating and Nonseparating Disjoint Homotopic Cycles in Graph Embeddings. J. Comb. Theory, Ser. B 66(2): 201-231 (1996) | |
| j39 | Martin Juvan, Aleksander Malnic, Bojan Mohar: Systems of Curves on Surfaces. J. Comb. Theory, Ser. B 68(1): 7-22 (1996) | |
| j38 | Bojan Mohar, Neil Robertson: Planar Graphs on Nonplanar Surfaces. J. Comb. Theory, Ser. B 68(1): 87-111 (1996) | |
| j37 | Bojan Mohar, Neil Robertson: Disjoint Essential Cycles. J. Comb. Theory, Ser. B 68(2): 324-349 (1996) | |
| c4 | ||
| 1995 | ||
| j36 | Bojan Mohar: Uniqueness and Minimality of Large Face-Width Embeddings of Graphs. Combinatorica 15(4): 541-556 (1995) | |
| j35 | Sandi Klavzar, Bojan Mohar: The chromatic numbers of graph bundles over cycles. Discrete Mathematics 138(1-3): 301-314 (1995) | |
| j34 | Martin Juvan, Bojan Mohar: Bond Contributions to the Wiener Index. Journal of Chemical Information and Computer Sciences 35(2): 217-219 (1995) | |
| j33 | Sandi Klavzar, Ivan Gutman, Bojan Mohar: Labeling of Benzenoid Systems which Reflects the Vertex-Distance Relations. Journal of Chemical Information and Computer Sciences 35(3): 590-593 (1995) | |
| j32 | Martin Juvan, Bojan Mohar, Ante Graovac, Sandi Klavzar, Janez Zerovnik: Fast computation of the Wiener index of fasciagraphs and rotagraphs. Journal of Chemical Information and Computer Sciences 35(5): 834-840 (1995) | |
| j31 | ||
| c3 | Martin Juvan, Joze Marincek, Bojan Mohar: Embedding Graphs in the Torus in Linear Time. IPCO 1995: 360-363 | |
| 1994 | ||
| j30 | Bojan Mohar: Obstructions for the Disk and the Cylinder Embedding Extension Problems. Combinatorics, Probability & Computing 3: 375-406 (1994) | |
| j29 | Bojan Mohar: Convex Representations of Maps on the Torus and Other Flat Surfaces. Discrete & Computational Geometry 11: 83-95 (1994) | |
| j28 | Vladimir Batagelj, Dragan Marusic, Bojan Mohar, Tomaz Pisanski: Preface. Discrete Mathematics 134(1-3): 1 (1994) | |
| j27 | Steve Fisk, Bojan Mohar: Surface triangulations with isometric boundary. Discrete Mathematics 134(1-3): 49-62 (1994) | |
| j26 | Bojan Mohar: Extremal Mono-q-polyhexes. Journal of Chemical Information and Computer Sciences 34(5): 1127-1129 (1994) | |
| j25 | Steve Fisk, Bojan Mohar: Coloring Graphs without Short Non-bounding Cycles. J. Comb. Theory, Ser. B 60(2): 268-276 (1994) | |
| c2 | Bojan Mohar, Pierre Rosenstiehl: A Flow Approach to Upward Drawings of Toroidal Maps. Graph Drawing 1994: 33-39 | |
| 1993 | ||
| j24 | ||
| j23 | Bojan Mohar: A polynomial time circle packing algorithm. Discrete Mathematics 117(1-3): 257-263 (1993) | |
| j22 | ||
| j21 | Bojan Mohar, Darko Babic, Nenad Trinajstic: A novel definition of the Wiener index for trees. Journal of Chemical Information and Computer Sciences 33(1): 153-154 (1993) | |
| j20 | Martin Juvan, Bojan Mohar: Laplace eigenvalues and bandwidth-type invariants of graphs. Journal of Graph Theory 17(3): 393-407 (1993) | |
| c1 | Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl: A spectral approach to bandwidth and separator problems in graphs. IPCO 1993: 183-194 | |
| 1992 | ||
| j19 | Martin Juvan, Bojan Mohar: Optimal linear labelings and eigenvalues of graphs. Discrete Applied Mathematics 36(2): 153-168 (1992) | |
| j18 | Bojan Mohar: A domain monotonicity theorem for graphs and Hamiltonicity. Discrete Applied Mathematics 36(2): 169-177 (1992) | |
| j17 | Bojan Mohar: Laplace eigenvalues of graphs - a survey. Discrete Mathematics 109(1-3): 171-183 (1992) | |
| j16 | Aleksander Malnic, Bojan Mohar: Generating locally cyclic triangulations of surfaces. J. Comb. Theory, Ser. B 56(2): 147-164 (1992) | |
| 1991 | ||
| j15 | Bojan Mohar: Some relations between analytic and geometric properties of infinite graphs. Discrete Mathematics 95(1-3): 193-219 (1991) | |
| j14 | Bojan Mohar: Eigenvalues, diameter, and mean distance in graphs. Graphs and Combinatorics 7(1): 53-64 (1991) | |
| 1990 | ||
| j13 | Bojan Mohar, Tomaz Pisanski, Arthur T. White: Embeddings of cartesian products of nearly bipartite graphs. Journal of Graph Theory 14(3): 301-310 (1990) | |
| 1989 | ||
| j12 | Bojan Mohar: An obstruction to embedding graphs in surfaces. Discrete Mathematics 78(1-2): 135-142 (1989) | |
| j11 | ||
| 1988 | ||
| j10 | Bojan Mohar: Nonorientable Genus of Nearly Complete Bipartite Graphs. Discrete & Computational Geometry 3: 137-146 (1988) | |
| j9 | ||
| j8 | ||
| 1987 | ||
| j7 | ||
| j6 | ||
| 1986 | ||
| j5 | ||
| j4 | Bojan Mohar: A common cover of graphs and 2-cell embeddings. J. Comb. Theory, Ser. B 40(1): 94-106 (1986) | |
| 1985 | ||
| j3 | ||
| 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. Discrete Mathematics 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, Ser. B 38(3): 193-203 (1985) | |
Data released under the ODC-BY 1.0 license — See also our legal information page