Occupation games on graphs in which the second player takes almost all vertices

DOI10.1016/J.DAM.2011.03.002MaRDI QIDQ642976zbMATH OpenOpenAlexFDO

Authors A. V. Shapovalov

Publication date 27 October 2011

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2011.03.002

zbMATH Keywords

GOoccupation games

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Combinatorial games (91A46)

Recommendations

• A two-person game on graphs where each player tries to encircle his opponent's men
• scientific article; zbMATH DE number 4181366
• Graph sharing games: complexity and connectivity
• A Graph-Grabbing Game
• scientific article; zbMATH DE number 279288

Cited in

(5)

• The largest connected subgraph game
• The largest connected subgraph game
• The complexity of two colouring games
• \textsc{influence}: a partizan scoring game on graphs
• On a vertex-capturing game

This page was built for publication: Occupation games on graphs in which the second player takes almost all vertices

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