scientific article; zbMATH DE number 3877237

zbMATH Open0551.05059MaRDI QIDQ3344237FDOQ3344237

Authors Fred Buckley, Frank Harary

Publication date 1984

zbMATH Keywords

diameteravoidance gameachievement game

Mathematics Subject Classification ID

2-person games (91A05) Paths and cycles (05C38) Graph theory (05C99)

Recommendations

• On Degree Achievement and Avoidance Games for Graphs
• Bounded degree, triangle avoidance graph games
• The domination game played on diameter 2 graphs
• scientific article; zbMATH DE number 3900800
• Connected, bounded degree, triangle avoidance games
• Avoider-Enforcer games played on edge disjoint hypergraphs
• Graph games and edge density of graphs
• Balanced avoidance games on random graphs
• Distance \(d\)-domination games
• The graph distance game and some graph operations

Cited in

(8)

• On Degree Achievement and Avoidance Games for Graphs
• The set coincidence game: Complexity, attainability, and symmetric strategies
• scientific article; zbMATH DE number 3900800 (Why is no real title available?)
• On Ringeisen's isolation game. II
• On the set coincidence game
• Minimum degree games for graphs
• The diameter game
• Impartial hypergraph games

This page was built for publication:

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