A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of thresholds graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discussiones Mathematicae Graph Theory Année : 2017

A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of thresholds graphs

Résumé

2010 Mathematics Subject Classification: 05C62, 05C75, 05C70, 05C65, 05C85

Dates et versions

hal-02127503 , version 1 (13-05-2019)

Identifiants

Citer

Yury Metelsky, Kseniya Schemeleva, Frank Werner. A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of thresholds graphs. Discussiones Mathematicae Graph Theory, 2017, 37 (1), pp.13-28. ⟨10.7151/dmgt.1916⟩. ⟨hal-02127503⟩
11 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More