research
∙
01/10/2023
Contact graphs of boxes with unidirectional contacts
This paper is devoted to the study of particular classes of geometricall...
share
research
∙
09/20/2022
Complement Avoidance in Binary Words
The complement x of a binary word x is obtained by changing each 0 in x ...
research
∙
09/19/2022
Antisquares and Critical Exponents
The complement x̅ of a binary word x is obtained by changing each 0 in x...
research
∙
07/20/2022
Pseudoperiodic Words and a Question of Shevelev
We generalize the familiar notion of periodicity in sequences to a new k...
research
∙
06/03/2022
Properties of a Ternary Infinite Word
We study the properties of the ternary infinite word p = 012102101021012...
research
∙
04/21/2021
Acyclic, Star, and Injective Colouring: Bounding the Diameter
We examine the effect of bounding the diameter for well-studied variants...
research
∙
07/07/2019
Complexity of planar signed graph homomorphisms to cycles
We study homomorphism problems of signed graphs. A signed graph is an un...
research
∙
05/29/2019
Oriented coloring of graphs with low maximum degree
Duffy et al. [C. Duffy, G. MacGillivray, and É. Sopena, Oriented colouri...
research
∙
05/06/2019
Partitioning sparse graphs into an independent set and a graph with bounded size components
We study the problem of partitioning the vertex set of a given graph so ...
research
∙
04/19/2019
New results on pseudosquare avoidance
We start by considering binary words containing the minimum possible num...
research
∙
11/20/2018
Avoiding conjugacy classes on the 5-letter alphabet
We construct an infinite word w over the 5-letter alphabet such that for...
research
∙
09/05/2018
Repetition avoidance in products of factors
We consider a variation on a classical avoidance problem from combinator...
research
∙
11/23/2017
