Four-Searchable Biconnected Outerplanar Graphs
| dc.authorid | Diner, Öznur Yaşar/0000-0002-9271-2691 | |
| dc.authorid | Dyer, Danny/0000-0001-6921-1517 | |
| dc.authorwosid | Diner, Öznur Yaşar/AAT-7443-2020 | |
| dc.contributor.author | Diner, Oznur Yasar | |
| dc.contributor.author | Yaşar Diner, Öznur | |
| dc.contributor.author | Dyer, Danny | |
| dc.contributor.author | Yang, Boting | |
| dc.contributor.other | Computer Engineering | |
| dc.date.accessioned | 2023-10-19T15:11:37Z | |
| dc.date.available | 2023-10-19T15:11:37Z | |
| dc.date.issued | 2022 | |
| 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, Canada | en_US |
| dc.description.abstract | This 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.sponsorship | EU 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.sponsorship | Oznur 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.citationcount | 0 | |
| dc.identifier.doi | 10.1016/j.dam.2021.09.011 | en_US |
| dc.identifier.endpage | 82 | en_US |
| dc.identifier.issn | 0166-218X | |
| dc.identifier.issn | 1872-6771 | |
| dc.identifier.scopus | 2-s2.0-85116863088 | en_US |
| dc.identifier.scopusquality | Q2 | |
| dc.identifier.startpage | 70 | en_US |
| dc.identifier.uri | https://doi.org/10.1016/j.dam.2021.09.011 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12469/5130 | |
| dc.identifier.volume | 306 | en_US |
| dc.identifier.wos | WOS:000709307700006 | en_US |
| dc.identifier.wosquality | Q3 | |
| dc.khas | 20231019-WoS | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Elsevier | en_US |
| dc.relation.ispartof | Discrete Applied Mathematics | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.scopus.citedbyCount | 0 | |
| dc.subject | Search | En_Us |
| dc.subject | Minors | En_Us |
| dc.subject | Width | En_Us |
| dc.subject | Graph minors | en_US |
| dc.subject | Search | |
| dc.subject | Edge searching | en_US |
| dc.subject | Minors | |
| dc.subject | Outerplanar graphs | en_US |
| dc.subject | Width | |
| dc.subject | Forbidden minors | en_US |
| dc.title | Four-Searchable Biconnected Outerplanar Graphs | en_US |
| dc.type | Article | en_US |
| dc.wos.citedbyCount | 0 | |
| dspace.entity.type | Publication | |
| relation.isAuthorOfPublication | 84ac79d3-823a-4abf-9b15-e1383ec8a9f5 | |
| relation.isAuthorOfPublication.latestForDiscovery | 84ac79d3-823a-4abf-9b15-e1383ec8a9f5 | |
| relation.isOrgUnitOfPublication | fd8e65fe-c3b3-4435-9682-6cccb638779c | |
| relation.isOrgUnitOfPublication.latestForDiscovery | fd8e65fe-c3b3-4435-9682-6cccb638779c |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- 5130.pdf
- Size:
- 477.42 KB
- Format:
- Adobe Portable Document Format
- Description:
- Tam Metin / Full Text