A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs (Q505460)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs |
scientific article; zbMATH DE number 6676783
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs |
scientific article; zbMATH DE number 6676783 |
Statements
A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs (English)
0 references
23 January 2017
0 references
intersection graph
0 references
hypergraph rank
0 references
hypergraph multiplicity
0 references
forbidden induced subgraph
0 references
threshold graph
0 references
