Please use this identifier to cite or link to this item:
https://elib.bsu.by/handle/123456789/195067| Title: | Бипороговые графы |
| Authors: | Зверович, И. Э. |
| Keywords: | ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Математика |
| Issue Date: | 2000 |
| Publisher: | Минск : Універсітэцкае |
| Citation: | Вестник Белорусского государственного университета. Сер. 1, Физика. Математика. Информатика. – 2000. - № 2. – С. 78-80. |
| Abstract: | A graph G is called bithreshold if there exist threshold graphs Ti = T, (V, E), i = I, 2, such that E = E i U E2 and every clique of G is a clique of either Ti or T2. We obtain a characterization of split bithreshold graphs in terms of forbidden induced subgraphs. |
| URI: | http://elib.bsu.by/handle/123456789/195067 |
| ISSN: | 0321-0367 |
| Licence: | info:eu-repo/semantics/openAccess |
| Appears in Collections: | 2000, №2 (май) |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.