Minimum degree games for graphs

DOI10.1016/0012-365X(94)90109-0MaRDI QIDQ1322180zbMATH OpenFDO

Authors Daniel M. Gordon, R. W. Robinson, Frank Harary

Publication date 1 December 1994

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

winning strategyavoidance game

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43)

Recommendations

• On Degree Achievement and Avoidance Games for Graphs
• The positive minimum degree game on sparse graphs
• scientific article; zbMATH DE number 3900800
• Bounded degree, triangle avoidance graph games
• Connected, bounded degree, triangle avoidance games

Cites work

• scientific article; zbMATH DE number 3877237 (Why is no real title available?)
• Connect-It Games
• On Degree Achievement and Avoidance Games for Graphs
• Parallel concepts in graph theory

Cited in

(9)

• On Degree Achievement and Avoidance Games for Graphs
• scientific article; zbMATH DE number 4081342 (Why is no real title available?)
• The positive minimum degree game on sparse graphs
• scientific article; zbMATH DE number 4095247 (Why is no real title available?)
• Bounded degree, triangle avoidance graph games
• Connected, bounded degree, triangle avoidance games
• Lower bounds on degrees of game-theoretic structures
• Minimum light numbers in the \(\sigma \)-game and lit-only \(\sigma \)-game on unicyclic and grid graphs
• Impartial hypergraph games

This page was built for publication: Minimum degree games for graphs

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