Cops and Robbers on Intersection Graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10189961" target="_blank" >RIV/00216208:11320/13:10189961 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-45030-3_17" target="_blank" >http://dx.doi.org/10.1007/978-3-642-45030-3_17</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-45030-3_17" target="_blank" >10.1007/978-3-642-45030-3_17</a>

Result language
angličtina
Original language name
Cops and Robbers on Intersection Graphs
Original language description
The game of cops and robber, introduced by Nowakowski and Winkler in 1983, is played by two players on a graph G, one controlling k cops and the other one robber, all positioned on V G . The players alternate in moving their pieces to distance at most 1each. The cops win if they capture the robber, the robber wins by escaping indefinitely. The cop-number of G, that is the smallest k such that k cops win the game, has recently been a widely studied parameter. Intersection graph classes are defined by their geometric representations: the vertices are represented by certain geometrical shapes and two vertices are adjacent if and only if their representations intersect. Some well-known intersection classes include interval and string graphs. Various properties of many of these classes have been studied recently, including an interest in their game-theoretic properties. In this paper we show an upper bound on the cop-number of string graphs and sharp bounds on the cop-number of interval fi
Czech name
—
Czech description
—

Project
<a href="/en/project/GEGIG%2F11%2FE023" target="_blank" >GEGIG/11/E023: Graph Drawings and Representations</a><br>
Continuities
S - Specificky vyzkum na vysokych skolach

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)