Topological network-control games
From MaRDI portal
Cites work
- \textsc{influence}: a partizan scoring game on graphs
- A generalization of \textsc{Arc-Kayles}
- A metric for positional games
- A PSPACE-complete graph nim
- Automata, logics, and infinite games. A guide to current research
- Combinatorial analysis of a subtraction game on graphs
- Combinatorial game theory
- Compound Node-Kayles on paths
- Computing strategies for graphical Nim
- Corrigendum to: ``The orthogonal colouring game
- Guard games on graphs: keep the intruder out!
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 1944416 (Why is no real title available?)
- scientific article; zbMATH DE number 1834637 (Why is no real title available?)
- scientific article; zbMATH DE number 7199604 (Why is no real title available?)
- scientific article; zbMATH DE number 3078996 (Why is no real title available?)
- Kayles and Nimbers
- Mean play of sums of positional games
- Network control games played on graphs
- Octal games on graphs: the game 0.33 on subdivided stars and bistars
- On a vertex-capturing game
- On complexity of Ehrenfeucht-Fraïssé games
- Polynomial time graph families for Arc Kayles
- Scoring play combinatorial games
- Spy-game on graphs: complexity and simple topologies
- The largest connected subgraph game
- The maker-breaker largest connected subgraph game
- Topological network-control games
- Topological network-control games played on graphs
- Über mathematische Kampfspiele.
- Vertex Nim played on graphs
- Winning ways for your mathematical plays. Vol. 1.
This page was built for publication: Topological network-control games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6848796)
