Study of a combinatorial game in graphs through linear programming
From MaRDI portal
Publication:5136239
Recommendations
Cites work
- scientific article; zbMATH DE number 1665333 (Why is no real title available?)
- scientific article; zbMATH DE number 5575574 (Why is no real title available?)
- scientific article; zbMATH DE number 2174620 (Why is no real title available?)
- scientific article; zbMATH DE number 2104838 (Why is no real title available?)
- A bound for the cops and robbers problem
- A game of cops and robbers
- Connected surveillance game
- Cops and robbers from a distance
- Cops and robbers is EXPTIME-complete
- Eternal domination numbers of \(4\times n\) grid graphs
- Eternal domination numbers of \(5\times n\) grid graphs
- Graph theory
- Pursuing a fast robber on a graph
- Spy-game on graphs
- The domination number of grids
- The game of cops and robbers on graphs
- To satisfy impatient web surfers is hard
- Vertex-to-vertex pursuit in a graph
Cited in
(5)
This page was built for publication: Study of a combinatorial game in graphs through linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136239)