1 citations · 2 across the 2 of their papers we have counts for
4 papers
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…
Vertex arboricity of cographs
Sebastián González Hermosillo de la Maza, Pavol Hell, César Hernández Cruz +2
Arboricity is a graph parameter akin to chromatic number, in that it seeks to partition the vertices into the smallest number of sparse subgraphs. Where for the chromatic number we…
Cops and robbers on oriented toroidal grids
Sebastian Gonzalez Hermosillo de la Maza, Seyyed Aliasghar Hosseini, Fiachra Knox +2
The game of cops and robbers is a well-known game played on graphs. In this paper we consider the straight-ahead orientations of 4-regular quadrangulations of the torus and the Kle…
On the structure of (claw,bull)-free graphs
Sebastián González Hermosillo de la Maza, Yifan Jing, Masood Masjoody
In this research, we determine the structure of (claw, bull)-free graphs. We show that every connected (claw, bull)-free graph is either an expansion of a path, an expansion of a c…