Geodetic contraction games on graphs

DOI10.1007/BF01254296zbMATH Open0678.90098OpenAlexW1969156875MaRDI QIDQ1124532FDOQ1124532

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

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

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)

Cites Work

• Title not available (Why is that?)
• A complete analysis of von Neumann's Hackendot

Cited In (8)

• Localization game on geometric and planar graphs
• Geodetic Contraction Games on Trees
• Title not available (Why is that?)
• Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
• Strong geodetic problem on Cartesian products of graphs
• GEODETIC GAMES FOR GRAPHS
• Geodetic Achievement and Avoidance Games For Graphs
• Title not available (Why is that?)

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)