GEODETIC GAMES FOR GRAPHS
From MaRDI portal
Recommendations
Cites work
Cited in
(23)- Geodetic contraction games on graphs
- Localization game on geometric and planar graphs
- Localization game for random geometric 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
- Extreme Geodesic Graphs
- Geodetic Achievement and Avoidance Games For Graphs
- Impartial hypergraph games
- The localization game on oriented graphs
- The general position avoidance game and hardness of general position games
- The graph distance game
- 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
- Geodetic set on graphs of constant pathwidth and feedback vertex set number
- The closed geodetic game: algorithms and strategies
This page was built for publication: GEODETIC GAMES FOR GRAPHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4724436)