The following pages link to Nancy E. Clarke (Q244920):
Displaying 29 items.
- Characterizations of \(k\)-copwin graphs (Q408176) (← links)
- On 2-limited packings of complete grid graphs (Q526269) (← links)
- (Q708372) (redirect page) (← links)
- Edge critical cops and robber (Q708375) (← links)
- A witness version of the cops and robber game (Q1025953) (← links)
- Ambush cops and robbers (Q2053707) (← links)
- Reconfiguration graphs for dominating sets (Q2073197) (← links)
- Hamilton paths in dominating graphs of trees and cycles (Q2093102) (← links)
- Cops that surround a robber (Q2197471) (← links)
- A note on the cops and robber game on graphs embedded in non-orientable surfaces (Q2441345) (← links)
- Tandem-win graphs (Q2568474) (← links)
- (Q2744388) (← links)
- (Q2770438) (← links)
- A simple method of computing the catch time (Q2940090) (← links)
- (Q3534277) (← links)
- (Q3614018) (← links)
- (Q4552216) (← links)
- (Q4594210) (← links)
- (Q4677834) (← links)
- Bounding the search number of graph products (Q5215862) (← links)
- (Q5310227) (← links)
- A Tandem version of the Cops and Robber Game played on products of graphs (Q5492639) (← links)
- A note on bounds for the cop number using tree decompositions (Q5499967) (← links)
- A note on the Grundy number and graph products (Q5962510) (← links)
- A note on hyperopic cops and robber (Q6174757) (← links)
- Time-delayed cops and robbers (Q6648280) (← links)
- Discrete-time immunization number (Q6739969) (← links)
- Eternally surrounding a robber (Q6741031) (← links)
- Cops against a cheating robber (Q6744944) (← links)
