Geodetic Achievement and Avoidance Games For Graphs

DOI10.2989/16073600309486069zbMATH Open1152.05377OpenAlexW2052802372MaRDI QIDQ4820580FDOQ4820580

Authors: Teresa W. Haynes, Michael A. Henning, Charlotte Tiller 

Publication date: 15 October 2004

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073600309486069

Recommendations

• GEODETIC GAMES FOR GRAPHS
• scientific article; zbMATH DE number 4035609
• scientific article; zbMATH DE number 3900800
• scientific article; zbMATH DE number 4085454
• Geodetic contraction games on graphs

zbMATH Keywords

avoidance gameachievement gamegeodetic covergeodetic closure

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) 2-person games (91A05) Games involving graphs (91A43)

Cited In (10)

• Localization game on geometric and planar graphs
• The lower and upper forcing geodetic numbers of block--cactus graphs
• The general position avoidance game and hardness of general position games
• Title not available (Why is that?)
• Geodetic contraction games on graphs
• The general position achievement game played on graphs
• The lower and upper forcing geodetic numbers of complete \(n\)-partite graphs, \(n\)-dimensional meshes and tori
• Impartial hypergraph games
• GEODETIC GAMES FOR GRAPHS
• Title not available (Why is that?)

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)