Please use this identifier to cite or link to this item:
https://elib.bsu.by/handle/123456789/258849| Title: | 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 |
| Authors: | Metelsky, Y. Schemeleva, K. Werner, F. |
| Keywords: | ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Математика ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Механика |
| Issue Date: | 2017 |
| Publisher: | University of Zielona Gora |
| Citation: | Discuss Math Gr Theory 2017;37(1):13-28. |
| Abstract: | We characterize the class L23 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 L23 in the class of threshold graphs, where n is the number of vertices of a tested graph. |
| URI: | https://elib.bsu.by/handle/123456789/258849 |
| DOI: | 10.7151/dmgt.1916 |
| Scopus: | 85010206617 |
| Sponsorship: | BRFFR (Projects F11OB-064 and F13MLD012), and by DAAD. |
| Appears in Collections: | Кафедра математической кибернетики (статьи) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| DMGT-1916.pdf | 197,59 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.