Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

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

From MaRDI portal
Publication:642976
Jump to:navigation, search

DOI10.1016/J.DAM.2011.03.002zbMATH Open1235.91029OpenAlexW1978235220MaRDI QIDQ642976FDOQ642976


Authors: A. V. Shapovalov Edit this on Wikidata


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




Recommendations

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


zbMATH Keywords

GOoccupation games


Mathematics Subject Classification ID

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



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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:642976&oldid=12540823"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 08:38. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki