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
We characterize the class L32$L_3^2 $ of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 by means of a finite list of forbidden induced subgraphs in the class of threshold graphs. We also give an O(n)-time algorithm for the recognition of graphs from L32$L_3^2 $ in...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Artigo |
| Language: | Inglês |
| Published: |
University of Zielona Góra
2017-02-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.1916 |
| Tags: |
No Tags, Be the first to tag this record!
|