scientific article; zbMATH DE number 1735736

zbMATH Open0990.91008MaRDI QIDQ4329129FDOQ4329129

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

Publication date: 14 August 2002

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

triangle-free graphgraph gamesavoidance games

Mathematics Subject Classification ID

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

Cited In (13)

• The first player wins the one-colour triangle avoidance game on 16 vertices
• The constructor-blocker game
• Bounded degree, triangle avoidance graph games
• Transitive avoidance games on boards of odd size
• Connected, bounded degree, triangle avoidance games
• Title not available (Why is that?)
• Bichromatic triangle games
• A note on the one-colour avoidance game on graphs
• Game matching number of graphs
• Impartial hypergraph games
• Avoidance game on Steiner triple systems
• An upper bound on the extremal version of Hajnal's triangle-free game
• Transitive avoidance 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 Q4329129)