16 citations · 81 across the 23 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019
Bounding the cop number of a graph by its genus
Nathan Bowler, Joshua Erde, Florian Lehner +1
It is known that the cop number of a connected graph can be bounded as a function of the genus of the graph . The best known bound, that $c(G) \leq \left\lfloor \f…
math.CO2019★ 8 cited
Perfect matroids over hyperfields
Nathan Bowler, Rudi Pendavingh
We investigate valuated matroids with an additional algebraic structure on their residue matroids. We encode the structure in terms of representability over stringent hyperfields.…