Four-searchable biconnected outerplanar graphs

Simple item page
dc.authoridDiner, Öznur Yaşar/0000-0002-9271-2691
dc.authoridDyer, Danny/0000-0001-6921-1517
dc.authorwosidDiner, Öznur Yaşar/AAT-7443-2020
dc.contributor.authorDiner, Oznur Yasar
dc.contributor.authorDyer, Danny
dc.contributor.authorYang, Boting
dc.date.accessioned2023-10-19T15:11:37Z
dc.date.available2023-10-19T15:11:37Z
dc.date.issued2022
dc.department-temp[Diner, Oznur Yasar] Univ Politecn Cataluna, Math Dept, Barcelona, Spain; [Diner, Oznur Yasar] Kadir Has Univ, Comp Engn Dept, Istanbul, Turkey; [Dyer, Danny] Mem Univ Newfoundland, Dept Math & Stat, St John, NF, Canada; [Yang, Boting] Univ Regina, Dept Comp Sci, Regina, SK, Canadaen_US
dc.description.abstractThis paper deals with constructing obstruction sets for two subclasses of 4-searchable graphs. We first characterize the 4-searchable biconnected outerplanar graphs by listing all graphs that cannot be their minors; we then give a constructive characterization of such graphs. We also characterize the 4-searchable biconnected generalized wheel graphs by listing all graphs that cannot be their minors. Crown Copyright (C) 2021 Published by Elsevier B.V. All rights reserved.en_US
dc.description.sponsorshipEU Marie Curie International Reintegration, European Union [PIRG07/GA/2010/268322]; Kadir Has University BAP, Turkey [2011-BAP-07]; NSERC, Canada [RGPIN-2018-06800]en_US
dc.description.sponsorshipOznur Yasar Diner is partially supported by the EU Marie Curie International Reintegration, European Union Grant [grant number PIRG07/GA/2010/268322] and by Kadir Has University BAP, Turkey [grant number 2011-BAP-07]. Danny Dyer is partially supported by NSERC, Canada. Boting Yang is partially supported by an NSERC, Canada Discovery Research Grant [grant number RGPIN-2018-06800].en_US
dc.identifier.citation0
dc.identifier.doi10.1016/j.dam.2021.09.011en_US
dc.identifier.endpage82en_US
dc.identifier.issn0166-218X
dc.identifier.issn1872-6771
dc.identifier.scopus2-s2.0-85116863088en_US
dc.identifier.scopusqualityQ2
dc.identifier.startpage70en_US
dc.identifier.urihttps://doi.org/10.1016/j.dam.2021.09.011
dc.identifier.urihttps://hdl.handle.net/20.500.12469/5130
dc.identifier.volume306en_US
dc.identifier.wosWOS:000709307700006en_US
dc.identifier.wosqualityQ3
dc.khas20231019-WoSen_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofDiscrete Applied Mathematicsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectSearchEn_Us
dc.subjectMinorsEn_Us
dc.subjectWidthEn_Us
dc.subjectGraph minorsen_US
dc.subjectSearch
dc.subjectEdge searchingen_US
dc.subjectMinors
dc.subjectOuterplanar graphsen_US
dc.subjectWidth
dc.subjectForbidden minorsen_US
dc.titleFour-searchable biconnected outerplanar graphsen_US
dc.typeArticleen_US
dspace.entity.typePublication

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
5130.pdf
Size:
477.42 KB
Format:
Adobe Portable Document Format
Description:
Tam Metin / Full Text
Download

Collections

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