Skip to Main content Skip to Navigation

Resolution of some optimisation problems on graphs and combinatorial games

Gabrielle Paris 1, 2
Abstract : I studied three optimization problems on graphs and combinatorial games.First, identifying codes were studied : vertices couteract faults. Identifying codes help locate the fault to repare it. We focused on circulant graphs by embedding them on infinite grids.Then, the marking and the coloring games were studied : two player games were one player wants to build something (a proper coloration or a proper marking) and the other wants to prevent the first player from doing so. For the marking game we studied the evolution of the strategy when modifying the graph. For the coloring game we defined a new edge-wise decomposition of graphs and we defined a new strategy on this decomposition that improves known results on planar graphs.In the end, I studied pure breaking games : two players take turns to break a heap of tokens in a given number of non-empty heaps. We focused on winning strategies for the game starting with a unique heap on n tokens. These games seem, on first sight, to be all regular : we showed this is the case for some of them and we gave a test to study one game at a time. Only one of these games does not seem to be regular, its behavior remains a mystery.To sum up, I studied three bilateral problems that use different methods and have different purposes in combinatorics
Document type :
Complete list of metadata

Cited literature [91 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Saturday, January 12, 2019 - 3:23:27 PM
Last modification on : Tuesday, June 1, 2021 - 2:08:09 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01944544, version 2


Gabrielle Paris. Resolution of some optimisation problems on graphs and combinatorial games. Discrete Mathematics [cs.DM]. Université de Lyon, 2018. English. ⟨NNT : 2018LYSE1180⟩. ⟨tel-01944544v2⟩



Les métriques sont temporairement indisponibles