Polynomial time graph families for Arc Kayles
From MaRDI portal
Publication:2953097
zbMATH Open1371.05180MaRDI QIDQ2953097FDOQ2953097
Authors: Brett Stevens, Melissa Huggan
Publication date: 3 January 2017
Full work available at URL: http://www.emis.de/journals/INTEGERS/papers/q86/q86.Abstract.html
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Combinatorial games (91A46)
Cited In (12)
- Genetically modified games
- The polynomial profile of distance games on paths and cycles
- Winner determination algorithms for graph games with matching structures
- A generalization of \textsc{Arc-Kayles}
- Winner determination algorithms for graph games with matching structures
- Connected subtraction games on subdivided stars
- Topological network-control games
- Power sum polynomials as relaxed EGZ polynomials
- Kayles and Nimbers
- Exact algorithms for Kayles
- A codex of \(\mathcal{N}\)- and \(\mathcal{P}\)-positions in Harary's `caterpillar game'
- Exact algorithms for Kayles
This page was built for publication: Polynomial time graph families for Arc Kayles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953097)