Graph convexity impartial games: complexity and winning strategies

DOI10.1016/J.TCS.2024.114534MaRDI QIDQ6129703zbMATH OpenOpenAlexFDO

Authors Samuel N. Araújo, João Marcos Brito, Raquel Folz, Rosiane de Freitas, Rudini M. Sampaio

Publication date 17 April 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2024.114534

zbMATH Keywords

geodesic gamesgraph convexityimpartial gamesPSPACE-hardSprague-Grundy theory

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Impartial achievement games on convex geometries
• On the complexity of the misère version of three games played on graphs
• Geography

Cited in

(5)

• The closed geodetic game: algorithms and strategies
• Graph convexity partizan games: complexity and winning strategies
• The convex set forming game
• Algorithms and complexity of graph convexity partizan games
• The closed geodetic game: algorithms and strategies

This page was built for publication: Graph convexity impartial games: complexity and winning strategies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6129703)