2009 | ||
---|---|---|
120 | EE | Ken-ichi Kawarabayashi, Bojan Mohar: List-color-critical graphs on a fixed surface. SODA 2009: 1156-1165 |
119 | EE | Bojan Mohar: On the sum of k largest eigenvalues of graphs and symmetric matrices. J. Comb. Theory, Ser. B 99(2): 306-313 (2009) |
118 | EE | 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) |
117 | EE | 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) |
2008 | ||
116 | EE | 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 |
115 | EE | Vladimir P. Korzhik, Bojan Mohar: Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing. Graph Drawing 2008: 302-312 |
114 | EE | Sergio Cabello, Bojan Mohar: Crossing and Weighted Crossing Number of Near-Planar Graphs. Graph Drawing 2008: 38-49 |
113 | EE | Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar: Finding one tight cycle. SODA 2008: 527-531 |
112 | EE | Ken-ichi Kawarabayashi, Bojan Mohar: Graph and map isomorphism and all polyhedral embeddings in linear time. STOC 2008: 471-480 |
111 | EE | Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood: Improved upper bounds on the crossing number. Symposium on Computational Geometry 2008: 375-384 |
110 | EE | Matt DeVos, Bojan Mohar, Robert Sámal: Unexpected behaviour of crossing sequences. Electronic Notes in Discrete Mathematics 31: 259-264 (2008) |
109 | EE | Bojan Mohar, Simon Spacapan: Coloring parameters for graphs on surfaces. Electronic Notes in Discrete Mathematics 31: 281-286 (2008) |
108 | EE | Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar: Locally planar graphs are 5-choosable. J. Comb. Theory, Ser. B 98(6): 1215-1232 (2008) |
2007 | ||
107 | EE | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Bojan Mohar: Approximation algorithms via contraction decomposition. SODA 2007: 278-287 |
106 | EE | Sergio Cabello, Bojan Mohar: Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs. Discrete & Computational Geometry 37(2): 213-235 (2007) |
105 | EE | Sandi Klavzar, Dragan Marusic, Bojan Mohar, Tomaz Pisanski: Preface. Discrete Mathematics 307(3-5): 299 (2007) |
104 | EE | Janez Ales, Bojan Mohar, Tomaz Pisanski: Heuristic search for Hamilton cycles in cubic graphs. Discrete Mathematics 307(3-5): 303-309 (2007) |
103 | EE | 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) |
102 | EE | 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) |
101 | EE | Ken-ichi Kawarabayashi, Bojan Mohar: A relaxed Hadwiger's Conjecture for list colorings. J. Comb. Theory, Ser. B 97(4): 647-651 (2007) |
100 | EE | 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) |
2006 | ||
99 | EE | 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 |
98 | EE | Bojan Mohar, Andrej Vodopivec: On Polyhedral Embeddings of Cubic Graphs. Combinatorics, Probability & Computing 15(6): 877-893 (2006) |
97 | EE | 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) |
96 | EE | Bojan Mohar: Bar-Magnet Polyhedra and NS-Orientations of Maps. Discrete & Computational Geometry 35(3): 481-491 (2006) |
95 | EE | Matt DeVos, Bojan Mohar: Small separations in vertex-transitive graphs. Electronic Notes in Discrete Mathematics 24: 165-172 (2006) |
94 | EE | Michael O. Albertson, Bojan Mohar: Coloring Vertices and Faces of Locally Planar Graphs. Graphs and Combinatorics 22(3): 289-295 (2006) |
93 | EE | Bojan Mohar: Tree amalgamation of graphs and tessellations of the Cantor sphere. J. Comb. Theory, Ser. B 96(5): 740-753 (2006) |
92 | EE | Drago Bokal, Gasper Fijavz, Bojan Mohar: The Minor Crossing Number. SIAM J. Discrete Math. 20(2): 344-356 (2006) |
2005 | ||
91 | EE | Sergio Cabello, Bojan Mohar: Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs. ESA 2005: 131-142 |
90 | EE | Bojan Mohar: Triangulations and the Hajós Conjecture. Electr. J. Comb. 12: (2005) |
89 | EE | Bojan Mohar: Foreword. Eur. J. Comb. 26(3-4): 287-288 (2005) |
88 | EE | Martin Juvan, Bojan Mohar: 2-restricted extensions of partial embeddings of graphs. Eur. J. Comb. 26(3-4): 339-375 (2005) |
87 | EE | Bojan Mohar: Acyclic colorings of locally planar graphs. Eur. J. Comb. 26(3-4): 491-503 (2005) |
86 | EE | Sandi Klavzar, Bojan Mohar: Crossing numbers of Sierpinski-like graphs. Journal of Graph Theory 50(3): 186-198 (2005) |
2004 | ||
85 | EE | Bojan Mohar: Hajós Theorem For Colorings Of Edge-Weighted Graphs. Combinatorica 25(1): 65-76 (2004) |
84 | EE | Gasper Fijavz, Bojan Mohar: Rigidity and separation indices of Paley graphs. Discrete Mathematics 289(1-3): 157-161 (2004) |
83 | EE | 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) |
82 | EE | Bojan Mohar: Foreword. Eur. J. Comb. 25(6): 761-762 (2004) |
81 | EE | 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) |
80 | EE | 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 | ||
79 | EE | Gasper Fijavz, Bojan Mohar: K6-Minors in Projective Planar Graphs. Combinatorica 23(3): 453-465 (2003) |
78 | EE | Sylvain Gravier, Frédéric Maffray, Bojan Mohar: On a list-coloring problem. Discrete Mathematics 268(1-3): 303-308 (2003) |
77 | EE | Thomas Böhme, Bojan Mohar: Domination, Packing and Excluded Minors. Electr. J. Comb. 10: (2003) |
76 | EE | Bojan Mohar, Alexander Schrijver: Blocking nonorientability of a surface. J. Comb. Theory, Ser. B 87(1): 2-16 (2003) |
75 | EE | Tomás Feder, Pavol Hell, Bojan Mohar: Acyclic Homomorphisms and Circular Colorings of Digraphs. SIAM J. Discrete Math. 17(1): 161-169 (2003) |
2002 | ||
74 | Noga Alon, Bojan Mohar: The Chromatic Number Of Graph Powers. Combinatorics, Probability & Computing 11(1): (2002) | |
73 | EE | Sandi Klavzar, Dragan Marusic, Bojan Mohar: Preface. Discrete Mathematics 244(1-3): 1-4 (2002) |
72 | EE | Joze Marincek, Bojan Mohar: On approximating the maximum diameter ratio of graphs. Discrete Mathematics 244(1-3): 323-330 (2002) |
71 | EE | Bojan Mohar: Coloring Eulerian triangulations of the projective plane. Discrete Mathematics 244(1-3): 339-343 (2002) |
70 | EE | Gasper Fijavz, Martin Juvan, Bojan Mohar, Riste Skrekovski: Planar Graphs Without Cycles of Specific Lengths. Eur. J. Comb. 23(4): 377-388 (2002) |
69 | EE | Thomas Böhme, Bojan Mohar: Labeled K2, t Minors in Plane Graphs. J. Comb. Theory, Ser. B 84(2): 291-300 (2002) |
68 | EE | Bojan Mohar, Paul D. Seymour: Coloring Locally Bipartite Graphs on Surfaces. J. Comb. Theory, Ser. B 84(2): 301-310 (2002) |
67 | EE | 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) |
66 | EE | 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 | ||
65 | EE | Bojan Mohar: Existence of Polyhedral Embeddings of Graphs. Combinatorica 21(3): 395-401 (2001) |
64 | EE | Bojan Mohar, Riste Skrekovski: Nowhere-zero k-flows of Supergraphs. Electr. J. Comb. 8(1): (2001) |
63 | EE | 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) |
62 | EE | Bojan Mohar: Face Covers and the Genus Problem for Apex Graphs. J. Comb. Theory, Ser. B 82(1): 102-117 (2001) |
61 | EE | Bojan Mohar, Neil Robertson: Flexibility of Polyhedral Embeddings of Graphs in Surfaces. J. Comb. Theory, Ser. B 83(1): 38-57 (2001) |
2000 | ||
60 | EE | Bojan Mohar: Some Topological Methods in Graph Coloring Theory. Electronic Notes in Discrete Mathematics 5: 231-234 (2000) |
1999 | ||
59 | EE | Bojan Mohar: Drawing Graphs in the Hyperbolic Plane. Graph Drawing 1999: 127-136 |
58 | EE | Martin Juvan, Bojan Mohar, Robin Thomas: List Edge-Colorings of Series-Parallel Graphs. Electr. J. Comb. 6: (1999) |
57 | EE | Bojan Mohar, Riste Skrekovski: The Grötzsch Theorem for the Hypergraph of Maximal Cliques. Electr. J. Comb. 6: (1999) |
56 | EE | Bojan Mohar: A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface. SIAM J. Discrete Math. 12(1): 6-26 (1999) |
1998 | ||
55 | Dan Archdeacon, Nora Hartsfield, C. H. C. Little, Bojan Mohar: Obstruction Sets for Outer-Projective-Planar Graphs. Ars Comb. 49: (1998) | |
54 | Martin Juvan, Bojan Mohar, Riste Skrekovski: List Total Colourings of Graphs. Combinatorics, Probability & Computing 7(2): 181-188 (1998) | |
53 | EE | Bojan Mohar, Pierre Rosenstiehl: Tessellation and Visibility Representations of Maps on the Torus. Discrete & Computational Geometry 19(2): 249-263 (1998) |
52 | EE | Dragan Marusic, Bojan Mohar: Preface. Discrete Mathematics 182(1-3): 1 (1998) |
51 | EE | Bojan Mohar: On the orientable genus of graphs with bounded nonorientable genus. Discrete Mathematics 182(1-3): 245-253 (1998) |
50 | EE | D. Klabjan, Bojan Mohar: The number of matchings of low order in hexagonal systems. Discrete Mathematics 186(1-3): 167-175 (1998) |
49 | EE | Martin Juvan, Bojan Mohar, Riste Skrekovski: On list edge-colorings of subcubic graphs. Discrete Mathematics 187(1-3): 137-149 (1998) |
1997 | ||
48 | Bojan Mohar: Projective Plane and Möbius Band Obstructions. Combinatorica 17(2): 235-266 (1997) | |
47 | EE | Martin Juvan, Bojan Mohar, Janez Zerovnik: Distance-related Invariants on Polygraphs. Discrete Applied Mathematics 80(1): 57-71 (1997) |
46 | EE | Bojan Mohar: Apex graphs with embeddings of face-width three. Discrete Mathematics 176(1-3): 203-210 (1997) |
45 | EE | Bojan Mohar: Circle Packings of Maps in Polynomial Time. Eur. J. Comb. 18(7): 785-805 (1997) |
44 | EE | Martin Juvan, Bojan Mohar: Obstructions For 2-Möbius Band Embedding Extension Problem. SIAM J. Discrete Math. 10(1): 57-72 (1997) |
1996 | ||
43 | EE | Bojan Mohar: Embedding Graphs in an Arbitrary Surface in Linear Time. STOC 1996: 392-397 |
42 | EE | Bojan Mohar, Neil Robertson, Richard P. Vitray: Planar graphs on the projective plane. Discrete Mathematics 149(1-3): 141-157 (1996) |
41 | EE | Bojan Mohar: Straight-line representations of maps on the torus and other flat surfaces. Discrete Mathematics 155(1-3): 173-181 (1996) |
40 | EE | 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) |
39 | EE | Martin Juvan, Aleksander Malnic, Bojan Mohar: Systems of Curves on Surfaces. J. Comb. Theory, Ser. B 68(1): 7-22 (1996) |
38 | EE | Bojan Mohar, Neil Robertson: Planar Graphs on Nonplanar Surfaces. J. Comb. Theory, Ser. B 68(1): 87-111 (1996) |
37 | EE | Bojan Mohar, Neil Robertson: Disjoint Essential Cycles. J. Comb. Theory, Ser. B 68(2): 324-349 (1996) |
36 | EE | Ivan Gutman, Bojan Mohar: The Quasi-Wiener and the Kirchhoff Indices Coincide. Journal of Chemical Information and Computer Sciences 36(5): 982-985 (1996) |
1995 | ||
35 | Martin Juvan, Joze Marincek, Bojan Mohar: Embedding Graphs in the Torus in Linear Time. IPCO 1995: 360-363 | |
34 | Bojan Mohar: Uniqueness and Minimality of Large Face-Width Embeddings of Graphs. Combinatorica 15(4): 541-556 (1995) | |
33 | EE | Sandi Klavzar, Bojan Mohar: The chromatic numbers of graph bundles over cycles. Discrete Mathematics 138(1-3): 301-314 (1995) |
32 | Martin Juvan, Bojan Mohar: Bond Contributions to the Wiener Index. Journal of Chemical Information and Computer Sciences 35(2): 217-219 (1995) | |
31 | 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) | |
30 | 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) | |
1994 | ||
29 | Bojan Mohar, Pierre Rosenstiehl: A Flow Approach to Upward Drawings of Toroidal Maps. Graph Drawing 1994: 33-39 | |
28 | Bojan Mohar: Obstructions for the Disk and the Cylinder Embedding Extension Problems. Combinatorics, Probability & Computing 3: 375-406 (1994) | |
27 | Bojan Mohar: Convex Representations of Maps on the Torus and Other Flat Surfaces. Discrete & Computational Geometry 11: 83-95 (1994) | |
26 | EE | Vladimir Batagelj, Dragan Marusic, Bojan Mohar, Tomaz Pisanski: Preface. Discrete Mathematics 134(1-3): 1 (1994) |
25 | EE | Steve Fisk, Bojan Mohar: Surface triangulations with isometric boundary. Discrete Mathematics 134(1-3): 49-62 (1994) |
24 | EE | Steve Fisk, Bojan Mohar: Coloring Graphs without Short Non-bounding Cycles. J. Comb. Theory, Ser. B 60(2): 268-276 (1994) |
23 | EE | Bojan Mohar: Extremal Mono-q-polyhexes. Journal of Chemical Information and Computer Sciences 34(5): 1127-1129 (1994) |
1993 | ||
22 | Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl: A spectral approach to bandwidth and separator problems in graphs. IPCO 1993: 183-194 | |
21 | EE | Bojan Mohar: 7-critical graphs of bounded genus. Discrete Mathematics 112(1-3): 279-281 (1993) |
20 | EE | Bojan Mohar: A polynomial time circle packing algorithm. Discrete Mathematics 117(1-3): 257-263 (1993) |
19 | Bojan Mohar: Projective Planarity in Linear Time. J. Algorithms 15(3): 482-502 (1993) | |
18 | EE | 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) |
1992 | ||
17 | EE | Martin Juvan, Bojan Mohar: Optimal linear labelings and eigenvalues of graphs. Discrete Applied Mathematics 36(2): 153-168 (1992) |
16 | EE | Bojan Mohar: A domain monotonicity theorem for graphs and Hamiltonicity. Discrete Applied Mathematics 36(2): 169-177 (1992) |
15 | EE | Bojan Mohar: Laplace eigenvalues of graphs - a survey. Discrete Mathematics 109(1-3): 171-183 (1992) |
14 | EE | Aleksander Malnic, Bojan Mohar: Generating locally cyclic triangulations of surfaces. J. Comb. Theory, Ser. B 56(2): 147-164 (1992) |
1991 | ||
13 | EE | Bojan Mohar: Some relations between analytic and geometric properties of infinite graphs. Discrete Mathematics 95(1-3): 193-219 (1991) |
1989 | ||
12 | EE | Bojan Mohar: An obstruction to embedding graphs in surfaces. Discrete Mathematics 78(1-2): 135-142 (1989) |
11 | EE | Bojan Mohar: Isoperimetric numbers of graphs. J. Comb. Theory, Ser. B 47(3): 274-291 (1989) |
1988 | ||
10 | Bojan Mohar: Nonorientable Genus of Nearly Complete Bipartite Graphs. Discrete & Computational Geometry 3: 137-146 (1988) | |
9 | Bojan Mohar: Branced Covering. Discrete & Computational Geometry 3: 339-348 (1988) | |
8 | EE | Bojan Mohar: Embeddings of infinite graphs. J. Comb. Theory, Ser. B 44(1): 29-43 (1988) |
1987 | ||
7 | EE | Bojan Mohar: The enumeration of akempic triangulations. J. Comb. Theory, Ser. B 42(1): 14-23 (1987) |
6 | EE | Bojan Mohar: Simplicial schemes. J. Comb. Theory, Ser. B 42(1): 68-86 (1987) |
1986 | ||
5 | EE | Bojan Mohar: On the cycle space of graphs. Discrete Mathematics 58(1): 79-80 (1986) |
4 | EE | Bojan Mohar: A common cover of graphs and 2-cell embeddings. J. Comb. Theory, Ser. B 40(1): 94-106 (1986) |
1985 | ||
3 | EE | Bojan Mohar: Akempic triangulations with 4 odd vertices. Discrete Mathematics 54(1): 23-29 (1985) |
2 | EE | Bojan Mohar, Tomaz Pisanski, Martin Skoviera, Arthur White: The cartesian product of three triangles can be embedded into a surface of genus 7. Discrete Mathematics 56(1): 87-89 (1985) |
1 | EE | 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) |