5 citations · 11 across the 6 of their papers we have counts for
6 papers
Creating triangles in Constructor-Blocker games
Chloé Boisson, Yannick Mogge, Aline Parreau +1
Generalized Turán problems investigate the maximization of the number of certain structures (typically edges) under some constraints in a graph. We study a game version of these pr…
4-tangrams are 4-avoidable
Pascal Ochem, Théo Pierron
A tangram is a word in which every letter occurs an even number of times. Thus it can be cut into parts that can be arranged into two identical words. The \emph{cut number} of a ta…
Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity
Florent Foucaud, Hervé Hocquard, Dimitri Lajou +2
We study the complexity of graph modification problems with respect to homomorphism-based colouring properties of edge-coloured graphs. A homomorphism from edge-coloured graph …
Complexity of planar signed graph homomorphisms to cycles
François Dross, Florent Foucaud, Valia Mitsou +2
We study homomorphism problems of signed graphs. A signed graph is an undirected graph where each edge is given a sign, positive or negative. An important concept for signed graphs…
Quantifier Alternation for Infinite Words
Théo Pierron, Thomas Place, Marc Zeitoun
We investigate the expressive power of quantifier alternation hierarchy of first-order logic over words. This hierarchy includes the classes (sentences having at most blo…
Rings of invariants for the three dimensional modular representations of elementary abelian -groups of rank four
Théo Pierron, R. J. Shank
We show that the rings of invariants for the three dimensional modular representations of an elementary abelian -group of rank four are complete intersections with embedding dim…