C. Bentz

collaborators

3 papers

math.CO2026

Antimagic labelling of graphs with maximum degree $I^ (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…

math.CO2025

Antimagicness of graphs with a dominating clique

GrÃ©goire Beaudoire, CÃ©dric Bentz, Christophe Picouleau

A graph $G = (V, E)$ is called antimagic if there exists a bijective labelling $f : E \to {1, 2, \dots, ∣ E ∣}$ such that the vertex-sums of labels over edges incident to…

math.CO2025

Antimagic labellings of (k, 2)-bipartite biregular graphs

An antimagic labelling of a graph is a bijection from the set of edges to ${1, 2, \dots, m}$ , such that all vertex-sums are pairwise distinct, where the vertex-sum of a vertex…

Antimagic labelling of graphs with maximum degree I^(G)=n−4

Antimagicness of graphs with a dominating clique

Antimagic labellings of (k, 2)-bipartite biregular graphs

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