Geodetic contraction games on graphs

DOI10.1007/BF01254296MaRDI QIDQ1124532zbMATH OpenOpenAlexFDO

Authors Aviezri S. Fraenkel, Frank Harary

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 graphwinning strategiesgeodetic contraction gameslabeled verticesmisère play

Mathematics Subject Classification ID

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

Recommendations

• GEODETIC GAMES FOR GRAPHS
• scientific article; zbMATH DE number 4035609
• Geodetic Achievement and Avoidance Games For Graphs
• Geodetic contraction games on trees
• scientific article; zbMATH DE number 4181366

Cites work

• scientific article; zbMATH DE number 3761989 (Why is no real title available?)
• A complete analysis of von Neumann's Hackendot

Cited in

(8)

• Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
• GEODETIC GAMES FOR GRAPHS
• Geodetic Contraction Games on Trees
• scientific article; zbMATH DE number 4035609 (Why is no real title available?)
• Localization game on geometric and planar graphs
• scientific article; zbMATH DE number 4085454 (Why is no real title available?)
• Geodetic Achievement and Avoidance Games For Graphs
• Strong geodetic problem on Cartesian products of graphs

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

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