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): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/dmgt/MetelskyS017, #quickstatements; #temporary_batch_1731543907597 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/dmgt/MetelskyS017 / rank | |||
Normal rank | |||
Revision as of 01:30, 14 November 2024
scientific article
| 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 |
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
