AbstractTwo 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. We analyze the game for simple classes of hypergraphs, and discuss various related questions
NIM is a game in which two players take turns removing tokens from piles. There are usually several...
Letm and b be positive integers and let F be a hypergraph. In an (m, b) Maker-Breaker game F two pla...
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investig...
AbstractTwo players alternately select either a vertex or an edge of a hypergraph H, deleting it tog...
This paper presents a deletion game on graphs, called “Le Pic Arête.” Two players alternately remove...
9 pagesInternational audienceThis paper presents a eletion game on graph, called the "Pic'arete". Tw...
This paper presents a deletion game on graphs, called “Le Pic Arête. ” Two players alternately remov...
We consider a group of related combinatorial games all of which are played on an undirected graph. A...
The thesis is devoted to the study of graph and hypergraph games, which are cooperative games with c...
In a weak positional game, two players, Maker and Breaker, alternately claim vertices of a hypergrap...
AbstractWe define a new game, which is called an edge-removing game of star type. This game is playe...
In a weak positional game, two players, Maker and Breaker, alternately claim vertices of a hypergrap...
In a weak positional game, two players, Maker and Breaker, alternately claim vertices of a hypergrap...
In a weak positional game, two players, Maker and Breaker, alternately claim vertices of a hypergrap...
In a weak positional game, two players, Maker and Breaker, alternately claim vertices of a hypergrap...
NIM is a game in which two players take turns removing tokens from piles. There are usually several...
Letm and b be positive integers and let F be a hypergraph. In an (m, b) Maker-Breaker game F two pla...
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investig...
AbstractTwo players alternately select either a vertex or an edge of a hypergraph H, deleting it tog...
This paper presents a deletion game on graphs, called “Le Pic Arête.” Two players alternately remove...
9 pagesInternational audienceThis paper presents a eletion game on graph, called the "Pic'arete". Tw...
This paper presents a deletion game on graphs, called “Le Pic Arête. ” Two players alternately remov...
We consider a group of related combinatorial games all of which are played on an undirected graph. A...
The thesis is devoted to the study of graph and hypergraph games, which are cooperative games with c...
In a weak positional game, two players, Maker and Breaker, alternately claim vertices of a hypergrap...
AbstractWe define a new game, which is called an edge-removing game of star type. This game is playe...
In a weak positional game, two players, Maker and Breaker, alternately claim vertices of a hypergrap...
In a weak positional game, two players, Maker and Breaker, alternately claim vertices of a hypergrap...
In a weak positional game, two players, Maker and Breaker, alternately claim vertices of a hypergrap...
In a weak positional game, two players, Maker and Breaker, alternately claim vertices of a hypergrap...
NIM is a game in which two players take turns removing tokens from piles. There are usually several...
Letm and b be positive integers and let F be a hypergraph. In an (m, b) Maker-Breaker game F two pla...
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investig...
DOI
Add to ORKG