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...
Bewaard in:
| Hoofdauteurs: | , , |
|---|---|
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
University of Zielona Góra
2017-02-01
|
| Reeks: | Discussiones Mathematicae Graph Theory |
| Onderwerpen: | |
| Online toegang: | https://doi.org/10.7151/dmgt.1916 |
| Tags: |
Geen labels, Wees de eerste die dit record labelt!
|