Geodetic Achievement and Avoidance Games For Graphs
From MaRDI portal
Recommendations
Cited in
(18)- Geodetic contraction games on graphs
- Localization game on geometric and planar graphs
- The general position achievement game played on graphs
- The lower and upper forcing geodetic numbers of block--cactus graphs
- The lower and upper forcing geodetic numbers of complete n-partite graphs, n-dimensional meshes and tori
- scientific article; zbMATH DE number 4035609 (Why is no real title available?)
- scientific article; zbMATH DE number 4085454 (Why is no real title available?)
- Geodetic contraction games on trees
- GEODETIC GAMES FOR GRAPHS
- Impartial hypergraph games
- The general position avoidance game and hardness of general position games
- 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
- Categories of impartial rulegraphs and gamegraphs
- Impartial geodetic building games on graphs
- The closed geodetic game: algorithms and strategies
This page was built for publication: Geodetic Achievement and Avoidance Games For Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820580)