Pages that link to "Item:Q505460"
From MaRDI portal
The following pages link to 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):
Displaying 4 items.
- An \(O(n^3)\) time algorithm for recognizing threshold dimension 2 graphs (Q293369) (← links)
- Recognizing intersection graphs of linear uniform hypergraphs (Q1376077) (← links)
- Structure and complexity of 2-intersection graphs of 3-hypergraphs (Q2689256) (← links)
- Bounds on the nullity, the <i>H</i>-rank and the Hermitian energy of a mixed graph (Q4959321) (← links)