The Complexity of 2-Intersection Graphs of 3-Hypergraphs Recognition for Claw-free Graphs and triangulated Claw-free Graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2024

The Complexity of 2-Intersection Graphs of 3-Hypergraphs Recognition for Claw-free Graphs and triangulated Claw-free Graphs

Niccolò Di Marco
  • Fonction : Auteur
Andrea Frosini
  • Fonction : Auteur

Résumé

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. Di Marco et al. prove that deciding wether a graph G is the 2-intersection graph of a 3-uniform hypergraph is NP-complete. The main problems we study concern the class of claw-free graphs. We show that the recognition problem remains NP-complete when G is claw-free graphs but becomes polynomial if in addition G is triangulated.

Dates et versions

hal-04576670 , version 1 (15-05-2024)

Identifiants

Citer

Niccolò Di Marco, Andrea Frosini, Christophe Picouleau. The Complexity of 2-Intersection Graphs of 3-Hypergraphs Recognition for Claw-free Graphs and triangulated Claw-free Graphs. Discrete Applied Mathematics, 2024, 355, pp.232-246. ⟨10.1016/j.dam.2024.05.009⟩. ⟨hal-04576670⟩
15 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More