115 citations · 191 across the 17 of their papers we have counts for
21 papers
Feedback vertex sets of planar digraphs with fixed digirth
Simon Dreyer, Alexandre Pinlou, Petru Valicov
Let denote the size of a minimum feedback vertex set of a digraph . We study , which is the maximum over all -vertex planar digraphs of digirt…
The chromatic number of signed graphs with bounded maximum average degree
Fabien Jacques, Alexandre Pinlou
A signed graph is a simple graph with two types of edges: positive and negative edges. Switching a vertex of a signed graph corresponds to changing the type of each edge incide…
The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree
Christopher Duffy, Fabien Jacques, Mickael Montassier +1
A 2-edge-colored graph or a signed graph is a simple graph with two types of edges. A homomorphism from a 2-edge-colored graph to a 2-edge-colored graph is a mapping $φ: V(…
Homothetic triangle representations of planar graphs
Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou
We prove that every planar graph is the intersection graph of homothetic triangles in the plane.
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…
On non-repetitive sequences of arithmetic progressions:the cases
Borut Lužar, Martina Mockovčiaková, Pascal Ochem +2
A -subsequence of a sequence is a subsequence , for any positive integer and any , . A \textit{-Thue seque…