4 citations · 7 across the 14 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017
A generalization of Arc-Kayles
Antoine Dailly, Valentin Gledel, Marc Heinrich
The game Arc-Kayles is played on an undirected graph with two players taking turns deleting an edge and its endpoints from the graph. We study a generalization of this game, Weight…
cs.DM2017★ 2 cited
The switch operators and push-the-button games: a sequential compound over rulesets
Eric Duchene, Marc Heinrich, Urban Larsson +1
We study operators that combine combinatorial games. This field was initiated by Sprague-Grundy (1930s), Milnor (1950s) and Berlekamp-Conway-Guy (1970-80s) via the now classical di…
cs.DS2017
Computing maximum cliques in -EPG graphs
Nicolas Bousquet, Marc Heinrich
EPG graphs, introduced by Golumbic et al. in 2009, are edge-intersection graphs of paths on an orthogonal grid. The class -EPG is the subclass of EPG graphs where the path on…