Zobrazeno 1 - 10
of 23
pro vyhledávání: '"William B. Kinnersley"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 16 no. 3, Iss Graph Theory (2014)
Graph Theory
Externí odkaz:
https://doaj.org/article/16593dc32f8f4b149851ac8361e04ee8
Publikováno v:
Journal of Algebraic Combinatorics. 56:5-21
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::906fde416e795b3697cf33d8ede97080
https://doi.org/10.1007/s10801-022-01120-7
https://doi.org/10.1007/s10801-022-01120-7
Autor:
William B. Kinnersley, Eric Peterson
Publikováno v:
Journal of Combinatorics. 12:515-546
We consider a variant of Cops and Robbers wherein each edge traversed by the robber is deleted from the graph. The focus is on determining the minimum number of cops needed to capture a robber on a graph $G$, called the {\em bridge-burning cop number
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::48e4dcb87fac95655092ea45afbbdd96
https://doi.org/10.4310/joc.2021.v12.n3.a5
https://doi.org/10.4310/joc.2021.v12.n3.a5
We consider a variant of Cops and Robbers in which the robber may traverse as many edges as he likes in each turn, with the constraint that he cannot pass through any vertex occupied by a cop. We study this model on several classes of grid-like graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::03bfed9c13d190f78816bb0fdcf2fe00
Publikováno v:
Journal of Graph Theory. 85:481-495
Given a family ${\mathcal F}$ and a host graph $H$, a graph $G\subseteq H$ is ${\mathcal F}$-saturated relative to $H$ if no subgraph of $G$ lies in ${\mathcal F}$ but adding any edge from $E(H)-E(G)$ to $G$ creates such a subgraph. In the ${\mathcal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e5433d34ca82ce18d6c9dfb75cc037f6
https://doi.org/10.1002/jgt.22074
https://doi.org/10.1002/jgt.22074
Publikováno v:
Theoretical Computer Science. 627:107-111
We consider a Cops-and-Robber game played on the subsets of an n-set. The robber starts at the full set; the cops start at the empty set. In each round, each cop moves up one level by gaining an element, and the robber moves down one level by discard
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8dc2429b9570eaa62c652da3b0874d63
https://doi.org/10.1016/j.tcs.2016.02.030
https://doi.org/10.1016/j.tcs.2016.02.030
Publikováno v:
SIAM Journal on Discrete Mathematics. 30:20-35
In the domination game on a graph $G$, the players Dominator and Staller alternately select vertices of $G$. Each vertex chosen must strictly increase the number of vertices dominated. This process eventually produces a dominating set of $G$; Dominat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca57a1d2f815c756de46babfa350c07d
https://doi.org/10.1137/140976935
https://doi.org/10.1137/140976935
Publikováno v:
Journal of Combinatorics. 7:627-642
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::992892e6173994d33ab91a7b4ecdd30b
https://doi.org/10.4310/joc.2016.v7.n4.a4
https://doi.org/10.4310/joc.2016.v7.n4.a4
Autor:
William B. Kinnersley, Anthony Bonato
We consider the localization game played on graphs, wherein a set of cops attempt to determine the exact location of an invisible robber by exploiting distance probes. The corresponding optimization parameter for a graph $G$ is called the localizatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2825f4a0d8b1fc7c4d0a8224bfe488fd
http://arxiv.org/abs/1806.05286
http://arxiv.org/abs/1806.05286
Publikováno v:
Combinatorics, Probability and Computing. 24:829-837
We consider a variant of the game of Cops and Robbers, called Lazy Cops and Robbers, where at most one cop can move in any round. We investigate the analogue of the cop number for this game, which we call the lazy cop number. Lazy Cops and Robbers wa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fedb25c742d0c93edc732bd17193d794
https://doi.org/10.1017/s0963548314000807
https://doi.org/10.1017/s0963548314000807