Cops and Robbers on Intersection Graphs

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Cops and Robbers on Intersection Graphs

Popis výsledku v původním jazyce

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

Název v anglickém jazyce

Cops and Robbers on Intersection Graphs

Popis výsledku anglicky

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

Druh

D - Stať ve sborníku

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

<a href="/cs/project/GEGIG%2F11%2FE023" target="_blank" >GEGIG/11/E023: Kreslení grafů a jejich geometrické reprezentace</a><br>

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2013

Kód důvěrnosti údajů

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

Název statě ve sborníku

Lecture Notes in Computer Science

ISBN

978-3-642-45029-7

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

11

Strana od-do

174-184

Název nakladatele

Springer

Místo vydání

Neuveden

Místo konání akce

Hong Kong

Datum konání akce

16. 12. 2013

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—