Results 31 to 40 of about 199 (175)

Cops and robbers on 2K2-free graphs

open access: yesDiscrete Mathematics, 2022
We prove that the cop number of any $2K_2$-free graph is at most 2, proving a conjecture of Sivaraman and Testa. We also show that the upper bound of $3$ on the cop number of $2K_1+K_2$-free (co-diamond--free) graphs is best possible.
openaire   +3 more sources

Is bee‐avoidance by bird‐pollinated flowers driven by nectar robbing in Erica?

open access: yesFunctional Ecology, EarlyView.
Read the free Plain Language Summary for this article on the Journal blog. Abstract Nectar robbing (consuming nectar from a perforated flower without pollinating) generally negatively affects plant fecundity, and plants exhibit multiple mechanisms in defence.
Anina Coetzee   +4 more
wiley   +1 more source

Bounds for cops and robber pursuit

open access: yesComputational Geometry, 2010
We prove that the robber can evade (that is, stay at least unit distance from) at least $\lfloor n/5.889 \rfloor$ cops patroling an $n \times n$ continuous square region, that a robber can always evade a single cop patroling a square with side length $4$ or larger, and that a single cop on patrol can always capture the robber in a square with side ...
Alonso, Laurent, Reingold, Edward M.
openaire   +3 more sources

Cops and Robber - When Capturing is not Surrounding

open access: yesThe Electronic Journal of Combinatorics, 2023
We consider "surrounding" versions of the classic Cops and Robber game. The game is played on a connected graph in which two players, one controlling several cops and the other controlling a single robber, take alternating turns. In a turn, each player may move each of their pieces. The robber always moves between adjacent vertices. Regarding the moves
Paul Jungeblut   +2 more
openaire   +4 more sources

Cops and Robbers on Planar‐Directed Graphs

open access: yesJournal of Graph Theory, 2017
AbstractAigner and Fromme initiated the systematic study of the cop number of a graph by proving the elegant and sharp result that in every connected planar graph, three cops are sufficient to win a natural pursuit game against a single robber. This game, introduced by Nowakowski and Winkler, is commonly known as Cops and Robbers in the combinatorial ...
Loh, Po-Shen, Oh, Siyoung
openaire   +3 more sources

Acute‐Phase Interventions After Self‐Harm for Preventing Suicide and Recurrence: A Systematic Review and Meta‐Analysis

open access: yesActa Psychiatrica Scandinavica, EarlyView.
ABSTRACT Introduction Suicide risk is markedly elevated following presentation after self‐harm, yet the evidence base for interventions initiated in the immediate post‐presentation period has not been synthesized with specific attention to this high‐risk window. Clarifying which early interventions may reduce adverse outcomes is essential for informing
Guilherme Pimenta Roncete   +7 more
wiley   +1 more source

Police department design, political pressure, and racial inequality in arrests

open access: yesAmerican Journal of Political Science, EarlyView.
Abstract This paper theorizes a source of bias in discretionary arrests: strategic limits on police officer learning. Officers have a variety of tactics at their disposal besides arrest that they use for less serious offenses when they judge the underlying behavior to be less severe. In departments led by a chief with special expertise in crime control,
Andrew J. McCall
wiley   +1 more source

Risk of infection in dogs in contact with clinical canine leptospirosis cases

open access: yesAustralian Veterinary Journal, EarlyView.
Background and aim Canine leptospirosis cases have been increasing since the disease emerged in urban Sydney in 2017. Clinical infection is associated with a high case fatality rate and might pose public health risks. This study was conducted to determine whether Leptospira spp.
VJ Skinner, MP Ward, C Griebsch
wiley   +1 more source

Cops and Robbers on 1-Planar Graphs

open access: yes, 2023
Cops and Robbers is a well-studied pursuit-evasion game in which a set of cops seeks to catch a robber in a graph G, where cops and robber move along edges of G. The cop number of G is the minimum number of cops that is sufficient to catch the robber. Every planar graph has cop number at most three, and there are planar graphs for which three cops are ...
Stephane Durocher   +8 more
openaire   +2 more sources

The effectiveness of implementation intentions in children: A systematic review and meta‐analysis

open access: yesBritish Journal of Psychology, EarlyView.
Abstract Self‐regulation abilities in childhood are important for long‐term academic achievement and healthy development. As self‐regulatory abilities are still developing, ‘simple’ interventions are needed to foster self‐regulation. Implementation intentions are simple plans that could promote goal achievement in children.
Jasmin Breitwieser, Tilman Reinelt
wiley   +1 more source

Home - About - Disclaimer - Privacy