Algorithms and complexity of graph convexity partizan games

DOI10.1016/J.TCS.2025.115267MaRDI QIDQ6985816zbMATH OpenFDO

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

Publication date 12 May 2025

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

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115267

zbMATH Keywords

combinatorial game theorygeodesic gamesgraph convexitypartizan gamesPSPACE-hardnesssurreal numbers

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games involving graphs (91A43) Combinatorial games (91A46)

Cites work

• Complexity aspects of the triangle path convexity
• Complexity results related to monophonic convexity
• Convex sets in graphs. II: Minimal path convexity
• Convexity and HHD-Free Graphs
• Convexity in Graphs and Hypergraphs
• Games, puzzles, and computation
• Geodetic Achievement and Avoidance Games For Graphs
• GEODETIC GAMES FOR GRAPHS
• Graph convexity impartial games: complexity and winning strategies
• scientific article; zbMATH DE number 439012 (Why is no real title available?)
• scientific article; zbMATH DE number 4035609 (Why is no real title available?)
• scientific article; zbMATH DE number 4085454 (Why is no real title available?)
• scientific article; zbMATH DE number 3761989 (Why is no real title available?)
• scientific article; zbMATH DE number 3521877 (Why is no real title available?)
• scientific article; zbMATH DE number 3521878 (Why is no real title available?)
• Impartial geodetic building games on graphs
• On local convexity in graphs
• On the Carathéodory number for the convexity of paths of order three
• On the complexity of some two-person perfect-information games
• On triangle path convexity in graphs
• The general position avoidance game and hardness of general position games
• The hull number of a graph
• Über eine Anwendung der Mengenlehre auf die Theorie des Schachspiels.

This page was built for publication: Algorithms and complexity of graph convexity partizan games

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