1 citations · 1 across the 9 of their papers we have counts for
11 papers · 1 filter
Antimagic labelling of graphs with maximum degree
Grégoire Beaudoire, Cédric Bentz, Christophe Picouleau
An antimagic labelling of a graph is a bijection from to , such that all vertex-sums are pairwise distinct, where the vertex-sum of each verte…
Antimagicness of graphs with a dominating clique
Grégoire Beaudoire, Cédric Bentz, Christophe Picouleau
A graph is called antimagic if there exists a bijective labelling such that the vertex-sums of labels over edges incident to…
Antimagic labellings of (k, 2)-bipartite biregular graphs
Grégoire Beaudoire, Cédric Bentz, Christophe Picouleau
An antimagic labelling of a graph is a bijection from the set of edges to , such that all vertex-sums are pairwise distinct, where the vertex-sum of a vertex…
The Complexity of 2-Intersection Graphs of 3-Hypergraphs Recognition for Claw-free Graphs and triangulated Claw-free Graphs
Niccolò Di Marco, Andrea Frosini, Christophe Picouleau
Given a 3-uniform hypergraph H, its 2-intersection graph G has for vertex set the hyperedges of H and ee' is an edge of G whenever e and e' have exactly two common vertices in H. D…
On the complexity of Dominating Set for graphs with fixed diameter
Valentin Bouquet, François Delbot, Christophe Picouleau +1
A set of a graph is a dominating set if each vertex has a neighbor in or belongs to . Dominating Set is the problem of deciding, given a graph a…
The complexity of the Perfect Matching-Cut problem
Valentin Bouquet, Christophe Picouleau
Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with ma…