31 citations · 298 across the 114 of their papers we have counts for
6 papers · 2 filters
Interval minors of complete bipartite graphs
Bojan Mohar, Arash Rafiey, Behruz Tayfeh-Rezaie +1
Interval minors of bipartite graphs were recently introduced by Jacob Fox in the study of Stanley-Wilf limits. We investigate the maximum number of edges in -interval mino…
Cascades and Obstructions of Low Connectivity for Embedding Graphs into the Klein Bottle
Bojan Mohar, Petr Škoda
The structure of graphs with a 2-vertex-cut that are critical with respect to the Euler genus is studied. A general theorem describing the building blocks is presented. These const…
Crossing numbers of periodic graphs
Zdenek Dvorak, Bojan Mohar
A graph is periodic if it can be obtained by joining identical pieces in a cyclic fashion. It is shown that the limit crossing number of a periodic graph is computable. This answer…
Planar digraphs of digirth five are 2-colorable
Ararat Harutyunyan, Bojan Mohar
Neumann-Lara (1985) and Škrekovski conjectured that every planar digraph with digirth at least three is 2-colorable. We prove a relaxed version of this conjecture: every planar dig…
Homological face-width condition forcing -minors in graphs on surfaces
Roi Krakovski, Bojan Mohar
It is proved that every graph embedded on a (non-spherical) surface with non-separating face-width at least contains a minor isomorphic to . It is also shown that face-wid…
Median eigenvalues and the HOMO-LUMO index of graphs
Bojan Mohar
Motivated by the problem about HOMO-LUMO separation that arises in mathematical chemistry, Fowler and Pisanski introduced the notion of the HL-index which measures how large in abs…