C. Picouleau

activity

20132026

most citedThe four-in-a-tree problem in triangle-free graphs

11 citations · 19 across the 16 of their papers we have counts for

collaborators

Showing 2026Show all

2 papers · 1 filter

math.CO2026

Antimagicness of join graphs

Grégoire Beaudoire, Cédric Bentz, Christophe Picouleau

An antimagic labelling of a graph G = (V,E) is a bijection from E to {1,2,...,|E|}, such that all vertex-sums are pairwise distinct, where the vertex-sum of each vertex is the sum…

math.CO2026

Antimagic labelling of graphs with maximum degree $Δ (G) = n - 4$

Grégoire Beaudoire, Cédric Bentz, Christophe Picouleau

An antimagic labelling of a graph $G = (V, E)$ is a bijection from $E$ to ${1, 2, \dots, ∣ E ∣}$ , such that all vertex-sums are pairwise distinct, where the vertex-sum of each verte…

Antimagicness of join graphs

Antimagic labelling of graphs with maximum degree Δ(G)=n−4

Antimagic labelling of graphs with maximum degree $Δ (G) = n - 4$