11 citations · 19 across the 16 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.CO2023
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…
math.CO2023
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…