12 citations · 46 across the 32 of their papers we have counts for
5 papers · 1 filter
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…
Oriented coloring of graphs with low maximum degree
Pascal Ochem, Alexandre Pinlou
Duffy et al. [C. Duffy, G. MacGillivray, and É. Sopena, Oriented colourings of graphs with maximum degree three and four, Discrete Mathematics, 342(4), p. 959--974, 2019] recently…
Partitioning sparse graphs into an independent set and a graph with bounded size components
Ilkyoo Choi, François Dross, Pascal Ochem
We study the problem of partitioning the vertex set of a given graph so that each part induces a graph with components of bounded order; we are also interested in restricting these…
New results on pseudosquare avoidance
Tim Ng, Pascal Ochem, Narad Rampersad +1
We start by considering binary words containing the minimum possible numbers of squares and antisquares (where an antisquare is a word of the form ), and we complet…
Some further results on squarefree arithmetic progressions in infinite words
James Currie, Tero Harju, Pascal Ochem +1
In a recent paper, one of us posed three open problems concerning squarefree arithmetic progressions in infinite words. In this note we solve these problems and prove some addition…