12 citations · 46 across the 32 of their papers we have counts for
18 papers · 1 filter
Contact graphs of boxes with unidirectional contacts
Daniel Gonçalves, Vincent Limouzy, Pascal Ochem
This paper is devoted to the study of particular geometrically defined intersection classes of graphs. Those were previously studied by Magnant and Martin, who proved that these gr…
Properties of a Ternary Infinite Word
James Currie, Pascal Ochem, Narad Rampersad +1
We study the properties of the ternary infinite word p = 012102101021012101021012 ... , that is, the fixed point of the map h:0->01, 1->21, 2->0. We determine its factor complexity…
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…
Repetition avoidance in products of factors
Pamela Fleischmann, Pascal Ochem, Kamellia Reshadi
We consider a variation on a classical avoidance problem from combinatorics on words that has been introduced by Mousavi and Shallit at DLT 2013. Let be the su…
Vertex partitions of -free planar graphs
François Dross, Pascal Ochem
A graph is -colorable if its vertex set can be partitioned into a graph with maximum degree at most and and a graph with maximum degree at most . We show that…