31 citations · 298 across the 114 of their papers we have counts for
7 papers · 2 filters
Min-max theorem for the game of Cops and Robber on geodesic spaces
Bojan Mohar
The game of Cops and Robber is traditionally played on a finite graph. The purpose of this note is to introduce and analyze the game that is played on an arbitrary geodesic space.…
Proper orientations and proper chromatic number
Yaobin Chen, Bojan Mohar, Hehui Wu
The proper chromatic number $\Vecχ(G)$ of a graph is the minimum such that there exists an orientation of the edges of with all vertex-outdegrees at most and such t…
Universality in minor-closed graph classes
Tony Huynh, Bojan Mohar, Robert Šámal +2
Stanislaw Ulam asked whether there exists a universal countable planar graph (that is, a countable planar graph that contains every countable planar graph as a subgraph). János Pac…
Multicoloured Ramsey numbers of the path of length four
Henry Liu, Bojan Mohar, Yongtang Shi
Let denote the path on vertices. The -coloured Ramsey number of , denoted by , is the minimum integer such that whenever the complete graph on v…
A rainbow connectivity threshold for random graph families
Peter Bradshaw, Bojan Mohar
Given a family of graphs on a common vertex set , we say that is rainbow connected if for every vertex pair , there exists a path from t…
Random 2-cell embeddings of multistars
Jesse Campion Loth, Kevin Halasz, Tomáš Masařík +2
Random 2-cell embeddings of a given graph are obtained by choosing a random local rotation around every vertex. We analyze the expected number of faces, , of s…
Inducibility and universality for trees
Timothy F. N. Chan, Daniel Kral, Bojan Mohar +1
We answer three questions posed by Bubeck and Linial on the limit densities of subtrees in trees. We prove there exist positive and such that every…