Publications by Bojan Mohar, 1997-2005

Papers that have already been published are available in their original form (which is usually rather close to their published form) according to copyright agreements with publishers.

PostScript files of most of the older papers can be downloaded through the Preprint Server of IMFM. Newer papers will be on the arXiv.

PDF files can be accessed directly from this page.


  1. B. Mohar, On the sum of k largest eigenvalues of graphs and symmetric matrices, J. Combin. Theory, Ser. B 99 (2009) 306-313.[Electronic access][PDF file]
  2. M. DeVos, L. Goddyn, B. Mohar, A generalization of Kneser's Addition Theorem, Adv. Math. 220 (2009) 1531-1548.[Electronic access][PDF file]
  3. S. Cabello, B. Mohar, Crossing and weighted crossing number of near-planar graphs, in Graph Drawing, GD 2008, I.G. Tollis and M. Patrignani (Eds.), LNCS 5417, Springer-Verlag, 2009, pp. 38–49.[Electronic access][PDF file]
  4. V. P. Korzhik, B. Mohar, Minimal obstructions for 1-immersions and hardness of 1-planarity testing, in Graph Drawing, GD 2008, I.G. Tollis and M. Patrignani (Eds.), LNCS 5417, Springer-Verlag, 2009, pp. 302–312.[Electronic access][PDF file]
  5. M. Devos, L. Goddyn, B. Mohar, R. Samal, Cayley sum graphs and eigenvalues of (3,6)-fullerenes, J. Combin. Theory Ser. B 99 (2009) 358-369.[Electronic access][PDF file]
  6. K. Kawarabayashi, B. Mohar, List-color-critical graphs on a fixed surface, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'09), SIAM, 2009, pp.1156-1165.[Electronic access][PDF file]
  7. T. Bohme, K. Kawarabayashi, J. Maharry, B. Mohar, Linear connectivity forces large complete bipartite minors, J. Combin. Theory, Ser. B 99 (2009) 557-582.[Electronic access][PDF file]
  8. Bojan Mohar, Jesus Salas, A new Kempe invariant and the (non)-ergodicity of the Wang-Swendsen-Kotecky algorithm, J. Phys. A: Math. Theor. 42 (2009) 225204 (32pp).[Electronic access][PDF file][arXiv]
  9. B. Mohar, Algorithms and obstructions for embeddings, Chapter 4 in Topics in Topological Graph Theory", L. W. Beineke and R. J. Wilson (Eds.), Encyclopedia of Mathematics and Its Applications, Vol. 128, Cambridge University Press, Cambridge, 2009, pp. 62-80.
  10. B. Mohar, The genus crossing number, Ars Math. Contemp. 2 (2009), 157-162. [PDF file]
  11. Hal Kierstead, Bojan Mohar, Simon Spacapan, Daquing Yang, and Xuding Zhu, The two-coloring number and degenerate colorings of planar graphs, SIAM J. Discrete Math. 23 (2009) 1548-1560.[Electronic access][PDF file]


  1. S. Cabello, M. DeVos, J. Erickson, B. Mohar, Finding one tight cycle, Proc. 19th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM and SIAM, 2008, pp. 527-531.[PDF file]
  2. K. Kawarabayashi, B. Mohar, Graph and map isomorphism and all polyhedral embeddings in linear time, Proc. 40th annual ACM symposium on Theory of computing, Victoria, B.C., Canada, ACM, 2008, pp. 471-480.[Electronic access:][PDF file]
  3. Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar and David R. Wood, Improved upper bounds on the crossing number, SCG'08: Proc. 24th Annual Symposium on Computational Geometry, pp. 375-384, ACM Press, 2008.[Electronic access][PDF file]
  4. B. Mohar, The Four-Color Theorem, in The Princeton Companion to Mathematics, Chapter V.12, Ed. T. Gowers, Princeton University Press, 2008, pp. 696-698.
  5. K. Kawarabayashi, B. Mohar, B. Reed, A simpler linear time algorithm for embedding graphs into an arbitrary surface and the genus of graphs of bounded tree-width, Proc. 49th Ann. Symp. on Foundations of Computer Science (FOCS'08), IEEE, 2008, pp. 771-780.[Electronic access][PDF file]
  6. M. DeVos, K. Kawarabayashi, B. Mohar, Locally planar graphs are 5-choosable, J. Combin. Theory, Ser. B 98 (2008) 1215-1232.[Electronic access][PDF file]
  7. J. Ebrahimi B., B. Mohar, V. Nikiforov, A. Sheikh Ahmady, On the sum of two largest eigenvalues of a symmetric non-negative matrix, Linear Algebra Appl. 429 (2008) 2781-2787.[Electronic access][PDF file]
  8. B. Mohar, E. Steffen, A. Vodopivec, Relating embedding and coloring properties of snarks, Ars Math. Contemp. 1 (2008) 169-184.[Available online][PDF file]


  1. M. Juvan, J. Marinček, B. Mohar, Obstructions for simple embeddings, Australas. J. Combin. 38 (2007) 3-25. [PDF file]
  2. J. Aleš, B. Mohar, T. Pisanski, Heuristic search for hamilton cycles in cubic graphs, Discrete Math. 307 (2007) 303-309.[Electronic access][PDF file]
  3. M. DeVos, B. Mohar, An analogue of the Descartes-Euler formula for infinite graphs and Higuchi's conjecture, Trans. Amer. Math. Soc. 359 (2007) 3287-3300.[Electronic access][PDF file]
  4. Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar, Approximation algorithms via contraction decomposition, in "Proceedings of the Eighteenth Ann. ACM-SIAM Symp. on Discrete Algorithms," ACM, 2007, pp. 278-287.[PDF file]
  5. S. Cabello, B. Mohar, Finding shortest non-separating and non-contractible cycles for topologically embedded graphs, Discrete Comput. Geom. 37 (2007) 213-235.[ Electronic access] [PDF file]
  6. K.-I. Kawarabayashi, B. Mohar, Some recent progress and applications in graph minor theory, Graphs Combin. 23 (2007) 1-46. [Electronic access][PDF file]
  7. B. Mohar, On the Laplacian coefficients of acyclic graphs, Linear Algebra Appl. 422 (2007) 736-741. [Electronic access][PDF file]
  8. K.-I. Kawarabayashi, B. Mohar, A relaxed Hadwiger's Conjecture for list colorings, J. Combin. Theory, Ser. B 97 (2007) 647-651.[Electronic access][PDF file]
  9. M. Devos, J. Ebrahimi, M. Ghebleh, L. Goddyn, B. Mohar, R. Naserasr, Circular coloring the plane, SIAM J. Discrete Math. 21 (2007) 461-465.[Electronic access][PDF file]
  10. P. Bella, D. Kral, B. Mohar, K. Quittnerova, Labeling planar graphs with a condition at distance two, Europ. J. Combin. 28 (2007) 2201-2239.[Electronic access][PDF file]
  11. M. Devos, L. Goddyn, B. Mohar, R. Samal, A quadratic lower bound for subset sums, Acta Arithmetica 129 (2007) 187-195.[PDF file][arXiv]


  1. B. Mohar, Bar-magnet polyhedra and NS-orientations of maps, Discrete Comput. Geom. 35 (2006) 481-491.[Electronic access][PDF file]
  2. B. Mohar, What is . . . a graph minor, Notices of the AMS 53 (2006) 338-339.[PDF file]
  3. B. Mohar, Quadrangulations and 5-critical graphs on the projective plane, in ``Topics in Discrete Mathematics,'' M. Klazar, J. Kratochvil, M. Loebl, J. Matousek, R. Thomas, P. Valtr (Editors), Algorithms and Combinatorics 26, Springer, 2006, pp. 565-580.[Electronic access][PDF file]
  4. D. Bokal, G. Fijavž, B. Mohar, The minor crossing number, SIAM J. Discrete Math. 20 (2006) 344-356.[Electronic access][PDF file]
  5. K.-I. Kawarabayashi, B. Mohar, Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs, in ``Proc. 38th Ann. ACM Symp. on Theory of Computing, Seattle, Washington, USA, May 21-23, 2006,'' ACM Press, 2006, pp. 401-416.[Electronic access][PDF file]
  6. B. Mohar,  Tree amalgamation of graphs and tessellations of the Cantor sphere, J. Combin. Theory Ser. B 96 (2006) 740-753.[Electronic access][PDF file]
  7. B. Mohar, Universal obstructions for embedding extension problems, Australas. J. Combin. 36 (2006) 39-68. [PDF file]
  8. B. Mohar, Kempe equivalence of colorings, in ``Graph Theory in Paris, Proceedings of a Conference in Memory of Claude Berge," J.A. Bondy, J. Fonlupt, J.L. Fouquet, J.-C. Fournier, and J. Ramirez Alfonsin (Editors), Birkhauser, 2006, pp. 287-297.[Electronic access][PDF file]
  9. B. Mohar, A. Vodopivec, On polyhedral embeddings of cubic graphs, Combin. Probab. Comput. 15 (2006) 877-893.[Electronic access][PDF file]
  10. S. Cabello, M. DeVos, B. Mohar, Expected case for projecting points, Informatica 30 (2006) 289-293. [Available online][PDF file]
  11. B. Mohar, On the crossing number of almost planar graphs, Informatica 30 (2006) 301-303.[Available online][PDF file]
  12. M. Albertson, B. Mohar, Coloring vertices and faces of locally planar graphs, Graphs Combin. 22 (2006) 289-295.[Electronic access][PDF file]


  1. B. Mohar, Hajos theorem for colorings of edge-weighted graphs, Combinatorica 25 (2005) 65-76. [Electronic access][PDF file]
  2. B. Mohar, Acyclic colorings of locally planar graphs, Europ. J. Combin. 26 (2005) 491-503. [Electronic access][PDF file]
  3. M. Juvan, B. Mohar, 2-restricted extensions of partial embeddings of graphs, Europ. J. Combin. 26 (2005) 339-375. [Electronic access][PDF file]
  4. B. Mohar, Triangulations and the Hajos Conjecture, Electr. J. Combin. 12 (2005) N15, 7 pages. [Available online][PDF file]
  5. M. DeVos, L. Goddyn, B. Mohar, D. Vertigan, X. Zhu, Coloring-flow duality of embedded graphs, Trans. AMS 357 (2005) 3993-4016. [Electronic access][PDF file]
  6. S. Cabello, B. Mohar, Finding shortest non-separating and non-contractible cycles for topologically embedded graphs, in Algorithms - ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005. Proceedings, Editors G. S. Brodal and S. Leonardi, Lecture Notes in Computer Science 3669, Springer-Verlag, 2005, pp. 131-142.[Electronic access][PDF file]
  7. S. Klavžar, B. Mohar, Crossing numbers of Sierpinski-like graphs, J. Graph Theory 50 (2005) 186-198. [Electronic access][PDF file]


  1. B. Brešar, S. Klavžar, A. Lipovec, B. Mohar, Cubic inflation, mirror graphs, regular maps, and partial cubes, Europ. J. Combin. 25 (2004) 55-64. [Electronic access][PDF file]
  2. T. Böhme, B. Mohar, R. Škrekovski, M. Stiebitz, Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs, J. Graph Theory 45 (2004) 270-274. [Electronic access][PDF file]
  3. D. Bokal, G. Fijavž, M. Juvan, P. M. Kayll, B. Mohar, The circular chromatic number of a digraph, J. Graph Theory 46 (2004) 227-240. [Electronic access][PDF file]
  4. B. Mohar, Graph Laplacians, Chapter 4 in Topics in Algebraic Graph Theory, L.W. Beineke and R.J. Wilson (Eds.), Encyclopedia of Mathematics and Its Applications, Vol. 102, Cambridge University Press, Cambridge, 2004, pp. 113-136.
  5. D. Bokal, M. Juvan, B. Mohar, A spectral approach to graphical representation of data, Informatica 28 (2004) 233-238.[PDF file]
  6. G. Fijavž, B. Mohar, Rigidity and separation indices of Paley graphs, Discrete Math. 289 (2004) 157-161.[Electronic access][PDF file]


  1. M. Juvan, B. Mohar, Obstructions for 2-Möbius band embedding extension problem, SIAM J. Discrete Math. 10 (1997) 57-72. [Electronic access][PDF file]
  2. B. Mohar, On the minimal genus of 2-complexes, J. Graph Theory 24 (1997) 281-290.[Electronic access][PDF file]
  3. M. Juvan, J. Marinček, B. Mohar, Elimination of local bridges, Math. Slovaca 47 (1997) 85-92. [Available Online][PDF file]
  4. B. Mohar, Face-width of embedded graphs, Math. Slovaca 47 (1997) 35-63.[Electronic access][PDF file]
  5. B. Mohar, Some applications of Laplace eigenvalues of graphs, in "Graph Symmetry: Algebraic Methods and Applications," Eds. G. Hahn and G. Sabidussi, NATO ASI Ser. C 497, Kluwer, pp. 225-275.[Electronic access][PDF file]
  6. B. Mohar, Circle packings of maps in polynomial time, Europ. J. Combin. 18 (1997) 785-805.[Electronic access][PDF file]
  7. B. Mohar, Projective plane and Möbius band obstructions, Combinatorica 17 (1997) 235-266.[Electronic access][PDF file]
  8. B. Mohar, Apex graphs with embeddings of face-width three, Discrete Math. 176 (1997) 203-210.[Electronic access][PDF file]
  9. M. Juvan, B. Mohar, J. Žerovnik, Distance-related invariants on polygraphs, Discrete Appl. Math. 80 (1997) 57-71.[Electronic access][PDF file]
  10. B. Mohar, On the orientable genus of graphs with bounded nonorientable genus, Discrete Math. 182 (1998) 245-253.[Electronic access][PDF file]
  11. B. Mohar, P. Rosenstiehl, Tessellation and visibility representations of maps on the torus, Discrete Comput. Geom. 19 (1998) 249-263.[Electronic access][PDF file]
  12. D. Klabjan, B. Mohar, The number of matchings of low order in hexagonal systems, Discrete Math. 186 (1998) 167-175.[Electronic access][PDF file]
  13. M. Juvan, B. Mohar, R. Škrekovski, On list edge-colorings of subcubic graphs, Discrete Math. 187 (1998) 137-149.[Electronic access][PDF file]
  14. M. Juvan, B. Mohar, R. Škrekovski, List total colorings of graphs, Combin. Probab. Comput. 7 (1998) 181-188.[Electronic access]
  15. D. Archdeacon, N. Hartsfield, C. H. C. Little, B. Mohar, Obstruction sets for outer-projective-planar graphs, Ars Combin. 49 (1998) 113-127.[PDF file]
  16. B. Mohar, A linear time algorithm for embedding graphs in an arbitrary surface, SIAM J. Discrete Math. 12 (1999) 6--26.[Electronic access][PDF file]
  17. M. Juvan, B. Mohar, R. Škrekovski, Graphs of degree 4 are 5-edge-choosable, J. Graph Theory 32 (1999) 250-264.[Electronic access][PDF file]
  18. T. Böhme, B. Mohar, M. Stiebitz, Dirac's map-color theorem for choosability, J. Graph Theory 32 (1999) 327-339.[Electronic access][PDF file]
  19. B. Mohar, R. Škrekovski, Grötzsch Theorem for the hypergraph of maximal cliques, Electr. J. Combin. 6 (1) (1999) R26.[Available Online][PDF file]
  20. M. Juvan, B. Mohar, R. Thomas, List edge-colorings of series-parallel graphs, Electr. J. Combin. 6 (1) (1999) R42. [Available Online][PDF file]
  21. A. Graovac, M. Juvan, B. Mohar, J. Žerovnik, Computing the determinant and the algebraic structure count in polygraphs, Croat. Chem. Acta 72 (1999) 853-867.[PDF file]
  22. B. Mohar, Drawing graphs in the hyperbolic plane, in ``Graph Drawing GD'99,'' J. Kratochvil (Ed.), LNCS 1731, Springer-Verlag, Berlin, 1999, pp. 127-136.[Electronic access][PDF file]
  23. B. Mohar, Circle packings of maps - The Euclidean case, Rend. Sem. Mat. Fis. (Milano) 67 (1997) 191-206.[Electronic access][PDF file]
  24. B. Mohar, Light paths in 4-connected graphs in the plane and other surfaces, J. Graph Theory 34 (2000) 170-179.[Electronic access][PDF file]
  25. B. Mohar, Some topological methods in graph coloring theory (Extended Abstract), Electr. Notes in Discrete Math. 5 (2000) 255-258.[Electronic access][PDF file
  26. B. Mohar, R. Škrekovski, Nowhere-zero k-flows of supergraphs, Electr. J. Combinatorics 8 (1) (2001) R20. [Available Online][PDF file]
  27. B. Mohar, Graph minors and graphs on surfaces, in ``Surveys in Combinatorics, 2001'', Ed. J.W.P. Hirschfeld, London Mathematical Society Lecture Note Series 288, Cambridge Univ. Press, Cambridge, 2001, pp.145-163.[PDF file]
  28. B. Mohar, C. Thomassen, Graphs on Surfaces, The Johns Hopkins University Press, Baltimore and London, 2001, 291 + xi pages. [PDF file]
  29. B. Mohar, Face covers and the genus of apex graphs, J. Combin. Theory, Ser. B 82 (2001) 102-117. [PDF file] [Electronic access]
  30. B. Mohar, N. Robertson, Flexibility of polyhedral embeddings of graphs in surfaces, J.Combin. Theory, Ser. B 83 (2001) 38-57. [PDF file][Electronic access]
  31. B. Mohar, Existence of polyhedral embeddings of graphs, Combinatorica 21 (2001) 395-401.[PDF file][Electronic access]
  32. J. Marinček, B. Mohar, On approximating the maximum diameter ratio of graphs, Discrete Math. 244 (2002) 323-330.[Electronic access][PDF file]
  33. B. Mohar, Coloring Eulerian triangulations of the projective plane, Discrete Math. 244 (2002) 339-343.[Electronic access][PDF file]
  34. T. Böhme, B. Mohar, Labeled K2,t minors in plane graphs, J. Combin. Theory, Ser.B 84 (2002) 291-300.[Electronic access][PDF file]
  35. B. Mohar, P.D. Seymour, Coloring locally bipartite graphs on surfaces, J. Combin. Theory, Ser. B 84 (2002) 301-310.[Electronic access][PDF file]
  36. N. Alon, B. Mohar, The chromatic number of graph powers, Combin. Probab. Comput. 11 (2002) 1-10.[Electronic access][PDF file]
  37. T. Böhme, B. Mohar, C. Thomassen, Long cycles in graphs on a fixed surface, J. Combin. Theory, Ser. B 85 (2002) 338-347.[Electronic access][PDF file]
  38. G. Fijavž, M. Juvan, B. Mohar, R. Škrekovski, Planar graphs without cycles of specific lengths, Europ. J. Combin. 23 (2002) 377-388.[Electronic access][PDF file]
  39. B. Mohar, Light structures in infinite planar graphs without the strong isoperimetric property, Trans. Amer. Math. Soc. 354 (2002) 3059-3074.[PDF file]
  40. T. Böhme, J. Maharry, B. Mohar, Ka,k minors in graphs of bounded tree-width, J. Combin. Theory, Ser. B 86 (2002) 133-147.[Electronic access][PDF file]
  41. B. Mohar, A. Schrijver, Blocking nonorientability of a surface, J.Combin. Theory, Ser. B 87 (2003) 2-16.[Electronic access][PDF file]
  42. S. Gravier, F. Maffray, B. Mohar, On a list-coloring problem, Discrete Math. 268 (2003) 303-308.[Electronic access] [PDF file]
  43. B. Mohar, Circular colorings of edge-weighted graphs, J. Graph Theory 43 (2003) 107-116.[PDF file]
  44. S. Jones, P. M. Kayll, B. Mohar, W. D. Wallis, On constant-weight TSP tours, Discuss. Math. Graph Theory 23 (2003) 287-307.[PDF file]
  45. T. Böhme, B. Mohar, Domination, packing and excluded minors, Electr. J. Combin. 10(1) (2003) N9. [Available Online] [PDF file]
  46. G. Fijavž, B. Mohar, K6-minors in projective planar graphs, Combinatorica 23 (2003) 453-465. [Electronic access][PDF file]
  47. B. Mohar, R. Škrekovski, H.-J. Voss, Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9, J. Graph Theory 44 (2003) 261-295. [Electronic access][PDF file]
  48. T. Feder, P. Hell, B. Mohar, Acyclic homomorphisms and circular colorings of digraphs, SIAM J. Discrete Math. 17 (2003) 161-169.[Electronic access][PDF file]

Revised: October 26, 2015.