activity
20072026
most citedHermitian adjacency matrix of digraphs and mixed graphs

7 citations · 44 across the 47 of their papers we have counts for

collaborators
Showing 2020Show all

9 papers · 1 filter

math.CO20201 cited

The sandpile group of polygon rings and twisted polygon rings

Haiyan Chen, Bojan Mohar

Let be cycles with vertices (). By attaching these cycles together in a linear order, we obtain a graph called a polygon cha…

math.CO20201 cited

On a conjecture by Anthony Hill

Bojan Mohar

In the 1950's, English painter Anthony Hill described drawings of complete graphs in the plane having precisely $$H(n) = \tfrac{1}{4}\lfloor \tfrac{n}{2}\rfloor \, \lfloor \t…

cs.CG2020

Limiting crossing numbers for geodesic drawings on the sphere

Marthe Bonamy, Bojan Mohar, Alexandra Wesolek

We introduce a model for random geodesic drawings of the complete bipartite graph on the unit sphere in , where we select the vertices in eac…

math.CO2020

Automorphism groups of maps in linear time

Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela +1

By a map we mean a -cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can…

math.CO20201 cited

On the cop number of graphs of high girth

Peter Bradshaw, Seyyed Aliasghar Hosseini, Bojan Mohar +1

We establish a lower bound for the cop number of graphs of high girth in terms of the minimum degree, and more generally, in terms of a certain growth condition. We show, in partic…

math.CO20202 cited

Many flows in the group connectivity setting

Matt DeVos, Rikke Langhede, Bojan Mohar +1

Two well-known results in the world of nowhere-zero flows are Jaeger's 4-flow theorem asserting that every 4-edge-connected graph has a nowhere-zero $\mathbb{Z}_2 \times \mathbb{Z}…