31 citations · 298 across the 114 of their papers we have counts for
6 papers · 1 filter
Proper Orientations of Planar Bipartite Graphs
Fiachra Knox, Sebastián González Hermosillo de la Maza, Bojan Mohar +1
An orientation of a graph is proper if any two adjacent vertices have different indegrees. The proper orientation number of a graph is the minimum of…
Graphic TSP in cubic graphs
Zdenek Dvorak, Daniel Kral, Bojan Mohar
We present a polynomial-time 9/7-approximation algorithm for the graphic TSP for cubic graphs, which improves the previously best approximation factor of 1.3 for 2-connected cubic…
The crossing number of the cone of a graph
Carlos A. Alfaro, Alan Arroyo, Marek Derunár +1
Motivated by a problem asked by Richter and by the long standing Harary-Hill conjecture, we study the relation between the crossing number of a graph and the crossing number of…
Planar digraphs of digirth four are 2-colourable
Zhentao Li, Bojan Mohar
Neumann-Lara conjectured in 1985 that every planar digraph with digirth at least three is 2-colourable, meaning that the vertices can be 2-coloured without creating any monochromat…
Interlacing families and the Hermitian spectral norm of digraphs
Gary Greaves, Bojan Mohar, O Suil
It is proved that for any finite connected graph , there exists an orientation of such that the spectral radius of the corresponding Hermitian adjacency matrix is smaller or…
Minimal normal graph covers
David Gajser, Bojan Mohar
A graph is normal if it admits a clique cover and a stable set cover such that each clique in and each stable set in have a vert…