Four-searchable biconnected outerplanar graphs
Loading...
Files
Date
2022
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Open Access Color
OpenAIRE Downloads
OpenAIRE Views
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.
Description
Keywords
Search, Minors, Width, Graph minors, Search, Edge searching, Minors, Outerplanar graphs, Width, Forbidden minors
Turkish CoHE Thesis Center URL
Fields of Science
Citation
0
WoS Q
Q3
Scopus Q
Q2
Source
Discrete Applied Mathematics
Volume
306
Issue
Start Page
70
End Page
82