#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2009

2017

- This year (3)
- Last 5 years (10)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Przemyslaw Gordinowicz
- Theor. Comput. Sci.
- 2015

Let G be any connected graph on n vertices, n â‰¥ 2. Let k be any positive integer. Suppose that a fire breaks out on some vertex of G. Then in each turn k firefighters can protect vertices of G â€” eachâ€¦ (More)

- Anthony Bonato, Stephen Finbow, +5 authors Ladislav Stacho
- ArXiv
- 2013

We consider the new game of Cops and Attacking Robbers, which is identical to the usual Cops and Robbers game except that if the robber moves to a vertex containing a single cop, then that cop isâ€¦ (More)

- Przemyslaw Gordinowicz, Pawel Pralat
- Discussiones Mathematicae Graph Theory
- 2012

We consider the one-colour triangle avoidance game. Using a high performance computing network, we showed that the first player can win the game on 16 vertices.

- Przemyslaw Gordinowicz
- J. Math. Model. Algorithms
- 2009

The game of cops and robber, introduced by Nowakowski and Winkler in 1983, is played by two players on a graph. One controls k cops and the other a robber. The players alternate and move their piecesâ€¦ (More)

- Grzegorz Andrzejczak, Przemyslaw Gordinowicz
- Discrete Mathematics
- 2013

The (countable) perturbed existentially closed graph S (Gordinowicz, 2010 [5]) was introduced by the second author as a solution to a problem stated by Bonato (Problem 20 in Cameron (2003) [3]). Theâ€¦ (More)

- Anthony Bonato, Przemyslaw Gordinowicz, Gena Hahn
- Discrete Mathematics
- 2017

A relational characterization of cop-win graphs was provided by Nowakowski and Winkler in their seminal paper on the game of Cops and Robbers. As a by-product of that characterization, each cop-winâ€¦ (More)

One important problem in a network G is to locate an (invisible) moving entity by using distance-detectors placed at strategical locations in G. For instance, the famous metric dimension of a graph Gâ€¦ (More)

- Anthony Bonato, Przemyslaw Gordinowicz, Pawel Pralat
- Contributions to Discrete Mathematics
- 2010

Few families of tournaments satisfying the n-e.c. adjacency property are known. We supply a new random construction for generating infinite families of vertex-transitive n-e.c. tournaments byâ€¦ (More)

- Anthony Bonato, Przemyslaw Gordinowicz, Bill Kinnersley, Pawel Pralat
- Electr. J. Comb.
- 2013

In the game of Cops and Robbers, the capture time of a graph is the minimum number of moves needed by the cops to capture the robber, assuming optimal play. We prove that the capture time of theâ€¦ (More)