activity
20062026
most citedSpectral radius of finite and infinite planar graphs and of graphs of bounded genus

31 citations · 298 across the 114 of their papers we have counts for

collaborators
Showing 2009 · math.COShow all

8 papers · 2 filters

math.CO2009★ 2 cited

Unexpected behaviour of crossing sequences

Matt DeVos, Bojan Mohar, Robert Samal

The n-th crossing number of a graph G, denoted cr_n(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a>b>0, the…

math.CO2009★ 1 cited

The excluded minor structure theorem with planarly embedded wall

Bojan Mohar

A graph is nearly embedded in a surface if it consists of graph that is embedded in the surface, together with a bounded number of vortices having no large transactions. It i…

math.CO2009★ 1 cited

Strong embeddings of minimum genus

Bojan Mohar

A "folklore conjecture, probably due to Tutte" (as described in [P.D. Seymour, Sums of circuits, Graph theory and related topics (Proc. Conf., Univ. Waterloo, 1977), pp. 341-355, A…

math.CO2009★ 14 cited

Crossing-critical graphs with large maximum degree

Zdenek Dvorak, Bojan Mohar

A conjecture of Richter and Salazar about graphs that are critical for a fixed crossing number is that they have bounded bandwidth. A weaker well-known conjecture of Richter is…

math.CO2009★ 31 cited

Spectral radius of finite and infinite planar graphs and of graphs of bounded genus

Zdenek Dvorak, Bojan Mohar

It is well known that the spectral radius of a tree whose maximum degree is cannot exceed . In this paper we derive similar bounds for arbitrary planar graphs and…

math.CO2009★ 3 cited

Chromatic number and complete graph substructures for degree sequences

Zdenek Dvorak, Bojan Mohar

Given a graphic degree sequence , let (respectively , , and ) denote the maximum value of the chromatic number (respectively, the size of the largest cl…

math.CO2009

An Eberhard-like theorem for pentagons and heptagons

Matt DeVos, Agelos Georgakopoulos, Bojan Mohar +1

Eberhard proved that for every sequence of non-negative integers satisfying Euler's formula , there are infinitely many…

math.CO2009★ 23 cited

A new Kempe invariant and the (non)-ergodicity of the Wang-Swendsen-Kotecky algorithm

Bojan Mohar, Jesus Salas

We prove that for the class of three-colorable triangulations of a closed oriented surface, the degree of a four-coloring modulo 12 is an invariant under Kempe changes. We use this…