7 citations · 44 across the 43 of their papers we have counts for
7 papers · 1 filter
The Last Temptation of William T. Tutte
Bojan Mohar, Nathan Singer
In 1999, at one of his last public lectures, Tutte discussed a question he had considered since the times of the Four Color Conjecture. He asked whether the 4-coloring complex of a…
Cops and Robbers on graphs of bounded diameter
Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar
The game of Cops and Robbers is a well known game played on graphs. In this paper we consider the class of graphs of bounded diameter. We improve the strategy of cops and previousl…
Meyniel's conjecture on graphs of bounded degree
Seyyed Aliasghar Hosseini, Bojan Mohar, Sebastian Gonzalez Hermosillo de la Maza
The game of Cops and Robbers is a well known pursuit-evasion game played on graphs. It has been proved \cite{bounded_degree} that cubic graphs can have arbitrarily large cop number…
A new kind of Hermitian matrices for digraphs
Bojan Mohar
In an earlier work, the author together with Guo [Hermitian adjacency matrix of digraphs and mixed graphs, J. Graph Theory 85 (2017) 217-248] introduced the Hermitian adjacency mat…
The sandpile group of a polygon flower
Haiyan Chen, Bojan Mohar
Let be a cycle of length , and let be polygon chains. A polygon flower is a graph obtained by identifying the th edge of…
Fractional decompositions and the smallest-eigenvalue separation
Fiachra Knox, Bojan Mohar
A new method is introduced for bounding the separation between the value of and the smallest eigenvalue of a non-bipartite -regular graph. The method is based on fractional…