On Split B-1-EPG Graphs

Basit Öğe Kaydı
dc.contributor.authorDeniz, Zakir
dc.contributor.authorNivelle, Simon
dc.contributor.authorRies, Bernard
dc.contributor.authorSchindl, David
dc.date.accessioned2020-04-30T23:20:04Z
dc.date.available2020-04-30T23:20:04Z
dc.date.issued2018
dc.departmentDÜ, Fen-Edebiyat Fakültesi, Matematik Bölümüen_US
dc.description13th Latin American Theoretical Informatics Symposium (LATIN) -- APR 16-19, 2018 -- Buenos Aires, ARGENTINAen_US
dc.descriptionSchindl, David/0000-0002-7009-5530; Ries, Bernard/0000-0003-4395-5547en_US
dc.descriptionWOS: 000444835200027en_US
dc.description.abstractIn this paper, we are interested in edge intersection graphs of paths in a grid, such that each such path has at most one bend. These graphs were introduced in [12] and they are called B-1-EPG graphs. In particular, we focus on split graphs and characterise those that are B-1-EPG. This characterisation allows us to disprove a conjecture of Cameron et al. [7]. The existence of polynomial-time recognition algorithm for this graph class is still unknown. We furthermore investigate inclusion relationships among subclasses of split graphs that are B-1-EPG.en_US
dc.description.sponsorshipScientific and Technological Research Council of Turkey (TUBITAK) under 2214-A Doctoral Research Program Granten_US
dc.description.sponsorshipThe first author has been supported by the Scientific and Technological Research Council of Turkey (TUBITAK) under 2214-A Doctoral Research Program Grant during his stay in Switzerland. This work was done while the first and second authors visited the University of Fribourg, Switzerland. The support of the institution is gratefully acknowledged.en_US
dc.identifier.doi10.1007/978-3-319-77404-6_27en_US
dc.identifier.endpage375en_US
dc.identifier.isbn978-3-319-77404-6; 978-3-319-77403-9
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.scopusqualityQ3en_US
dc.identifier.startpage361en_US
dc.identifier.urihttps://doi.org/10.1007/978-3-319-77404-6_27
dc.identifier.urihttps://hdl.handle.net/20.500.12684/3922
dc.identifier.volume10807en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherSpringer International Publishing Agen_US
dc.relation.ispartofLatin 2018: Theoretical Informaticsen_US
dc.relation.ispartofseriesLecture Notes in Computer Science
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.titleOn Split B-1-EPG Graphsen_US
dc.typeConference Objecten_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
3922.pdf
Boyut:
524.44 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin / Full Text
İndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Bildiri Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu