A deletion game on hypergraphs

A deletion game on hypergraphs

0.00 Avg rating—0 Votes
Article ID: iaor19911656
Country: Netherlands
Volume: 30
Issue: 2/3
Start Page Number: 155
End Page Number: 162
Publication Date: Feb 1991
Journal: Discrete Applied Mathematics
Authors: ,
Abstract:

Two players alternately select either a vertex or an edge of a hypergraph H, deleting it together with all the edges containing the selected vertex or edge. The player first unable to move loses and the other player wins. The authors analyze the game for simple classes of hypergraphs, and discuss various related questions.

Reviews

Required fields are marked *. Your email address will not be published.