Alexandre Pinlou

activity

20132026

most citedGraphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable

3 citations · 8 across the 6 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

Feedback vertex sets of planar digraphs with fixed digirth

Simon Dreyer, Alexandre Pinlou, Petru Valicov

Let $f v s (G)$ denote the size of a minimum feedback vertex set of a digraph $G$ . We study $f v s_{g} (n)$ , which is the maximum $f v s (G)$ over all $n$ -vertex planar digraphs $G$ of digirt…

math.CO2021

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 $v$ of a signed graph corresponds to changing the type of each edge incide…

math.CO2020★ 2 cited

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 $G$ to a 2-edge-colored graph $H$ is a mapping $φ: V(…

math.CO2018

On non-repetitive sequences of arithmetic progressions:the cases $k \in {4, 5, 6, 7, 8}$

Borut Lužar, Martina Mockovčiaková, Pascal Ochem +2

A $d$ -subsequence of a sequence $φ = x_{1} \dots x_{n}$ is a subsequence $x_{i} x_{i + d} x_{i + 2 d} \dots$ , for any positive integer $d$ and any $i$ , $1 \leq i \leq n$ . A \textit{ $k$ -Thue seque…

Feedback vertex sets of planar digraphs with fixed digirth

The chromatic number of signed graphs with bounded maximum average degree

The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree

On non-repetitive sequences of arithmetic progressions:the cases k∈{4,5,6,7,8}

On non-repetitive sequences of arithmetic progressions:the cases $k \in {4, 5, 6, 7, 8}$