Pages that link to "Item:Q408176"
From MaRDI portal
The following pages link to Characterizations of \(k\)-copwin graphs (Q408176):
Displaying 24 items.
- Almost all cop-win graphs contain a universal vertex (Q418869) (← links)
- Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\) (Q468433) (← links)
- Cops and Robbers on diameter two graphs (Q482211) (← links)
- Cops and robbers ordinals of cop-win trees (Q512565) (← links)
- Edge critical cops and robber (Q708375) (← links)
- General cops and robbers games with randomness (Q820532) (← links)
- The complexity of zero-visibility cops and robber (Q897941) (← links)
- Edge-critical cops and robber in planar graphs (Q2017039) (← links)
- 4-cop-win graphs have at least 19 vertices (Q2032980) (← links)
- The one-cop-moves game on planar graphs (Q2051905) (← links)
- Ambush cops and robbers (Q2053707) (← links)
- A faster algorithm for cops and robbers (Q2166209) (← links)
- Containment: a variation of cops and robber (Q2175792) (← links)
- Limited visibility cops and robber (Q2185730) (← links)
- A tight lower bound for the capture time of the cops and robbers game (Q2196569) (← links)
- The one-cop-moves game on graphs with some special structures (Q2210510) (← links)
- Cops and robbers on \(2K_2\)-free graphs (Q2237234) (← links)
- Cops and robbers is EXPTIME-complete (Q2259861) (← links)
- A survey on the relationship between the game of cops and robbers and other game representations (Q2280205) (← links)
- Zero-visibility cops and robber and the pathwidth of a graph (Q2343977) (← links)
- The optimal capture time of the one-cop-moves game (Q2348264) (← links)
- A note on the cops and robber game on graphs embedded in non-orientable surfaces (Q2441345) (← links)
- Cops and robber on subclasses of \(P_5\)-free graphs (Q2699919) (← links)
- Fine-grained Lower Bounds on Cops and Robbers (Q5009566) (← links)
