The Copnumber of a Graph is Bounded by [3/2 genus ( G )] + 3

By B. Schröder. 2001

70 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/ddc87b1cd5cc76a1b7f3228fbda115cf40456e51

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Dimitrios M. Thilikos
2. Fedor V. Fomin
3. Dexter Campbell Kozen
4. Jiong Guo
5. Rolf Niedermeier
6. Stefan Szeider
7. Sebastian Ordyniak

In Discrete Mathematics and Combinatorics

1. Dimitrios M. Thilikos
2. Fedor V. Fomin

In Geometry and Topology

1. Dimitrios M. Thilikos
2. Fedor V. Fomin

Citations in the corpus

• An annotated bibliography on guaranteed graph searching (2008, background): “Schroeder [148] proved that for graphs of genus g, b 3g 2 c + 3 cops suffice to catch the robber.”