7 citations · 44 across the 41 of their papers we have counts for
7 papers · 1 filter
The inverse Voronoi problem in graphs
Édouard Bonnet, Sergio Cabello, Bojan Mohar +1
We introduce the inverse Voronoi diagram problem in graphs: given a graph with positive edge-lengths and a collection of subsets of vertices of , decide whet…
A golden ratio inequality for vertex degrees of graphs
Fiachra Knox, Bojan Mohar, David R. Wood
Motivated by the study of the crossing number of graphs, it is shown that, for trees, the sum of the products of the degrees of the end-vertices of all edges has an upper bound in…
Tight Upper Bounds on the Crossing Number in a Minor-Closed Class
Vida Dujmović, Ken-ichi Kawarabayashi, Bojan Mohar +1
The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. Our main result is that every graph that does not contain a fixed grap…
Fractional chromatic number of a random subgraph
Bojan Mohar, Hehui Wu
It is well known that a random subgraph of the complete graph has chromatic number w.h.p. Boris Bukh asked whether the same holds for a random subgraph of any $…
The genus of complete 3-uniform hypergraphs
Yifan Jing, Bojan Mohar
In 1968, Ringel and Youngs confirmed the last open case of the Heawood Conjecture by determining the genus of every complete graph . In this paper, we investigate the minimum…
The evolution of the structure of ABC-minimal trees
Seyyed Aliasghar Hosseini, Bojan Mohar, Mohammad Bagher Ahmadi
The atom-bond connectivity (ABC) index is a degree-based molecular descriptor that found diverse chemical applications. Characterizing trees with minimum ABC-index remained an elus…