Mohar, Bojan - Department of Mathematics, University of Ljubljana & Simon Fraser University

• DOI: 10.1007/s00454-006-1292-5 Discrete Comput Geom 37:213235 (2007) Discrete & Computational
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• Blocking nonorientability of a surface Bojan Mohar
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• Improved Upper Bounds on the Crossing Number
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• Ingrid Abfalter, University of Vienna ingrid@tbi.univie.ac.at
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• Digital Object Identifier (DOI) 10.1007/s00373-006-0684-x Graphs and Combinatorics (2007) 23:146
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• On polyhedral embeddings of cubic graphs Bojan Mohar
• Circular colorings of edge-weighted graphs Bojan Mohar
• 5th Slovenian International conference on Graph Theory List of participants
• 2-cell embeddings with prescribed face lengths and Bojan Mohar
• Graphs and Combinatories 7, 53-64 (1991) Combinatorics
• Call for Submissions -CanaDAM 2007 Canadian Discrete and Algorithmic Mathematics Conference 2007
• BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• A LINEAR TIME ALGORITHM FOR EMBEDDING GRAPHS IN AN ARBITRARY SURFACE
• LIGHT SUBGRAPHS IN PLANAR GRAPHS OF MINIMUM DEGREE 4 AND EDGE-DEGREE 9
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• K6-minors in projective planar graphs Gasper Fijavz
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• Light structures in infinite planar graphs without the strong isoperimetric property
• Coloring locally bipartite graphs on surfaces Bojan Mohar
• ._ DISCRETE MATHEMATICS
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• journal of combinatorial theory, Series B 68, 324 349 (1996) Disjoint Essential Cycles
• The 5th Slovenian International Conference on Graph Theory
• THE SPECTRAL RADIUS OF INFINITE GRAPHS N. L. BIGGS, BOJAN MOHAR AND JOHN SHAWE-TAYLOR
• Third Slovene International Conference in Graph Theory Monday, 26th June
• Nowhere-zero k-flows of supergraphs Bojan Mohar
• Light paths in 4-connected graphs in the plane and other surfaces
• COMBINATORICA 15 (4) (1995) 541 55t~ COMBINATORICA
• J. Chem. Inf: Comput. Sei. 1994,34, 1127-1 129 Extrema1 Mono-q-polyhexest
• Long cycles in graphs on a fixed surface Thomas Bohme
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• Labeled K2,t minors in plane graphs Thomas Bohme
• Approximating the List-Chromatic Number and the Chromatic Number in Minor-Closed
• Graphs of Degree 4 are 5-Edge-Choosable
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• Subdivisions of Large Complete Bipartite Graphs and Long Induced Paths in k-Connected Graphs
• 834 J. Chem. In$ Comput. Sci. 1995, 35,834-840 Fast Computation of the Wiener Index of Fasciagraphs and Rotagraphs
• SIAM J. DISCRETE MATH. c 2006 Society for Industrial and Applied Mathematics Vol. 20, No. 2, pp. 344356
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• Coloring Eulerian triangulations of the projective plane
• BOJAN MOHAR* University of Ljubljana
• Mathematica Slovaca Bojan Mohar
• journal of combinatorial theory, Series B 66, 201 231 (1996) Separating and Nonseparating Disjoint
• Flexibility of polyhedral embeddings of graphs in surfaces1 Bojan Mohar*
• ARTICLE IN PRESS Discrete Mathematics ( )
• Universal obstructions for embedding extension problems Bojan Mohar
• Neil 65 Group Picture Neil 65 Group Picture
• A SURVEY ON SPECTRA OF INFINITE GRAPHS BOJAN MOHAR AND WOLFGANG WOESS
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• Face covers and the genus problem for apex graphs1 Bojan Mohar*
• HEURISTIC SEARCH FOR HAMILTON CYCLES
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• Informatica 30 (2006) 301303 301 On the Crossing Number of Almost Planar Graphs
• Apex graphs with embeddings of face-width three Bojan Mohar
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• Circle packings of maps in polynomial time Bojan Mohar
• 590 J. Chem. In$ Comput. Sci. 1995, 35, 590-593 Labeling of Benzenoid Systems which Reflects the Vertex-Distance Relations
• MATHEMATICS ELSEVIER Discrete Mathematics 149 (1996) 141-157
• Combinatorics, Probability and Computing (19XX) 00, 000000. Printed in the United Kingdom c 19XX Cambridge University Press
• 2-restricted extensions of partial embeddings of graphs Martin Juvan
• Existence of polyhedral embeddings of graphs Bojan Mohar
• Kempe equivalence of edge-colourings in subcubic and subquartic graphs
• SIAM J. DISCRETE MATH. c 2007 Society for Industrial and Applied Mathematics Vol. 21, No. 2, pp. 461465
• Eigenvalues in Combinatorial Optimization Bojan Mohar
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• Recent Trends in Graph Theory, Bled, Slovenia, 2001 Monday, 24th September
• OBSTRUCTIONS FOR 2-MOBIUS BAND EMBEDDING EXTENSION PROBLEM
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• An Eberhard-like theorem for pentagons and Department of Mathematics
• ELSEVIER Discrete Mathematics 186 (1998) 167-175 MATHEMATICS
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• MATHEMATICS ELSEVIER Discrete Mathematics155 (1996) 173-181
• Embedding graphs in an arbitrary surface in linear time
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• THE LAPLACIAN SPECTRUM OF GRAPHS Bojan Mohar
• Is it true that every connected graph distinct from K3 of maximum degree d is (2d + 1, 2)-edge colourable?
• Removable Paths Conjectures Posted by Matthias Kriesell
• The 5th Slovenian International Conference on Graph Theory
• Fourth Slovene International Conference in Graph Theory Monday, 28th June
• Discrete Mathematics Algebraic and Topological Methods in Graph Theory
• Third announcement for The Third Slovenian International Conference
• Workshop on Colourings and Homomorphisms, July 17-July 28, 2000 Workshop on Colourings and Homomorphisms
• Obstructions for simple embeddings Martin Juvan
• An algorithm for embedding graphs in the torus Martin Juvan
• European Journal of Combinatorics 25 (2004) 5564 www.elsevier.com/locate/ejc
• Triangulations and the Hajos Conjecture Bojan Mohar
• Finding Shortest Non-separating and Non-contractible Cycles for Topologically
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• aGraphMinor Bojan Mohar
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• Graph Theory Trends in Mathematics, 287297
• Informatica 30 (2006) 289293 289 Expected Case for Projecting Points
• Digital Object Identifier (DOI) 10.1007/s00373-006-0653-4 Graphs and Combinatorics (2006) 22:289295
• EuroComb 2005 DMTCS proc. AE, 2005, 4144 Labeling planar graphs with a condition at
• Graph and Map Isomorphism and All Polyhedral Embeddings In Linear Time
• Improved Upper Bounds on the Crossing Number Vida Dujmovic
• Also available at http://amc.imfm.si ISSN 1855-3966 (printed ed.), ISSN 1855-3974 (electronic ed.)
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• Algorithmica DOI 10.1007/s00453-009-9357-5
• List-Color-Critical Graphs on a Fixed Surface Ken-ichi Kawarabayashi
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• J Math Chem (2010) 47:11451153 DOI 10.1007/s10910-009-9651-0
• On the non-ergodicity of the SwendsenWangKoteck algorithm on the kagom lattice This article has been downloaded from IOPscience. Please scroll down to see the full text article.
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• Adding One Edge to Planar Graphs Makes Crossing Number Hard
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• Unexpected behaviour of crossing sequences Matt DeVos Bojan Mohar
• Journal of Mathematical Chemistry 2(1988)267 277 267 HOW TO COMPUTE THE WIENER INDEX OF A GRAPH*
• Jottrnal of MathematicalChemistry 3(1989)403-406 403 COMPUTING THE CHARACTERISTIC POLYNOMIAL OF A TREE*
• Mathematical Programming 62 (1993) 557-574 557 North-Holland
• Embedding graphs in the torus in linear time * Martin 3uvan**, 3o~e Marin~ek**, Bojan Mohar**
• J. Chem. InJ Comput. Sci. 1995, 35, 217-219 Bond Contributions to the Wiener Index?
• A flow approach to upward drawings of toroidal maps
• journal of combinatorial theory, Series B 68, 7 22 (1996) Systems of Curves on Surfaces
• The Quasi-Wiener and the Kirchhoff Indices Coincide Ivan Gutman*,
• On the Minimal Genus of 2-Complexes
• Elimination of local bridges Martin Juvan, Joze Marincek, Bojan Mohar
• Projective plane and Mobius band obstructions Bojan Mohar
• Tessellation and visibility representations of maps on the torus
• ELSEVIER Discrete Mathematics 187 (1998) 137-149 MATHEMATICS
• OBSTRUCTION SETS FOR OUTER{PROJECTIVE{PLANAR GRAPHS Dan Archdeacon, Nora Hartsfield, C.H.C. Little, and Bojan Mohar
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• ISSN-0011-1643 CCA-2619 Original Scientific Paper
• Some Topological Methods in Graph Coloring Bojan Mohar 1
• Graph minors and graphs on surfaces12 Bojan Mohar
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• Ka,k minors in graphs of bounded tree-width * Thomas Bohme
• On a list-coloring problem Sylvain Gravier
• Domination, packing and excluded minors Thomas Bohme
• DiscreteComputGeom3:339-348(1988) ~)1988Sprinser-VertagNewY ~
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• Forward Looking Session Small and Large Graphs
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• journal of combinatorial theory, Series B 68, 87 111 (1996) Planar Graphs on Nonplanar Surfaces
• List edge-colorings of series-parallel graphs Martin Juvan
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• University of Ljubljana Institute of Mathematics, Physics and Mechanics
• Drawing Graphs in the Hyperbolic Plane Bojan Mohar
• Distance-related invariants on polygraphs Martin Juvan
• Obstructions for the disk and the cylinder embedding extension problems
• Crossing numbers of Sierpinski-like graphs Sandi Klavzar
• Planar graphs without cycles of speci c lengths G. Fijavz , M. Juvan , B. Mohar , and R. Skrekovski