scientific article; zbMATH DE number 1735736

MaRDI QIDQ4329129zbMATH OpenFDO

Authors S. Cater, Frank Harary, R. W. Robinson

Publication date 14 August 2002

zbMATH Keywords

avoidance gamesgraph gamestriangle-free graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Games involving graphs (91A43)

Recommendations

• A note on the one-colour avoidance game on graphs
• Bounded degree, triangle avoidance graph games
• Connected, bounded degree, triangle avoidance games
• On Hajnal's triangle-free game
• On Degree Achievement and Avoidance Games for Graphs

Cited in

(13)

• Bounded degree, triangle avoidance graph games
• Game matching number of graphs
• Transitive avoidance games on boards of odd size
• Bichromatic triangle games
• The first player wins the one-colour triangle avoidance game on 16 vertices
• A note on the one-colour avoidance game on graphs
• scientific article; zbMATH DE number 3989133 (Why is no real title available?)
• Avoidance game on Steiner triple systems
• Transitive avoidance games
• Impartial hypergraph games
• Connected, bounded degree, triangle avoidance games
• The constructor-blocker game
• An upper bound on the extremal version of Hajnal's triangle-free game

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 Q4329129)