Geodetic contraction games on graphs

DOI10.1007/BF01254296zbMath0678.90098OpenAlexW1969156875MaRDI QIDQ1124532

Frank Harary, Aviezri S. Fraenkel

Publication date: 1989

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01254296

zbMATH Keywords

treesshortest pathsfinite graphmisère playwinning strategiesgeodetic contraction gameslabeled vertices

Mathematics Subject Classification ID

2-person games (91A05) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (4)

Strong geodetic number of complete bipartite graphs and of graphs with specified diameter ⋮ Strong geodetic problem on Cartesian products of graphs ⋮ Geodetic Contraction Games on Trees ⋮ GEODETIC GAMES FOR GRAPHS

Cites Work

• Unnamed Item
• A complete analysis of von Neumann's Hackendot

This page was built for publication: Geodetic contraction games on graphs