3 citations · 3 across the 2 of their papers we have counts for
3 papers
math.CO2018★ 3 cited
Partition games
Antoine Dailly, Eric Duchene, Urban Larsson +1
We introduce CUT, the class of 2-player partition games. These are NIM type games, played on a finite number of heaps of beans. The rules are given by a set of positive integers, w…
cs.DM2018
Optimal bounds on codes for location in circulant graphs
Ville Junnila, Tero Laihonen, Gabrielle Paris
Identifying and locating-dominating codes have been studied widely in circulant graphs of type over the recent years. In 2013, Ghebleh and Niepel studied loca…
math.CO2017
Solving Two Conjectures regarding Codes for Location in Circulant Graphs
Ville Junnila, Tero Laihonen, Gabrielle Paris
Identifying and locating-dominating codes have been widely studied in circulant graphs of type , which can also be viewed as power graphs of cycles. Recently,…