Four-Searchable Biconnected Outerplanar Graphs
Loading...
Files
Date
2022
Authors
Diner, Oznur Yasar
Dyer, Danny
Yang, Boting
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Average
Popularity
Average
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, Minors, Forbidden minors, Width, Outerplanar graphs, Search, Edge searching, Graph minors, edge searching, outerplanar graphs, forbidden minors, Planar graphs; geometric and topological aspects of graph theory, Graph theory (including graph drawing) in computer science, graph minors
Turkish CoHE Thesis Center URL
Fields of Science
0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
Citation
WoS Q
Q2
Scopus Q
Q3
OpenCitations Citation Count
N/A
Source
Discrete Applied Mathematics
Volume
306
Issue
Start Page
70
End Page
82
PlumX Metrics
Citations
Scopus : 0
