Four-searchable biconnected outerplanar graphs

被引：0

作者：

Diner, Oznur Yasar ^{[1
,2
]}

Dyer, Danny ^{[3
]}

Yang, Boting ^{[4
]}

机构：

[1] Univ Politecn Cataluna, Math Dept, Barcelona, Spain

[2] Kadir Has Univ, Comp Engn Dept, Istanbul, Turkey

[3] Mem Univ Newfoundland, Dept Math & Stat, St John, NF, Canada

[4] Univ Regina, Dept Comp Sci, Regina, SK, Canada

来源：

DISCRETE APPLIED MATHEMATICS | 2022年 / 306卷

基金：

加拿大自然科学与工程研究理事会;

关键词：

Graph minors; Edge searching; Outerplanar graphs; Forbidden minors; SEARCH; MINORS; WIDTH;

D O I：

10.1016/j.dam.2021.09.011

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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.

引用

页码：70 / 82

页数：13

共 50 条

[1] Maximum packing for biconnected outerplanar graphs
Kovacs, T
Lingas, A
[J]. DISCRETE APPLIED MATHEMATICS, 2000, 100 (1-2) : 85 - 94
[2] Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs
Zhuang, Bingbing
Nagamochi, Hiroshi
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2011, E94D (02): : 211 - 219
[3] SUBGRAPH ISOMORPHISM FOR BICONNECTED OUTERPLANAR GRAPHS IN CUBIC TIME
LINGAS, A
[J]. THEORETICAL COMPUTER SCIENCE, 1989, 63 (03) : 295 - 302
[4] SUBGRAPH ISOMORPHISM FOR BICONNECTED OUTERPLANAR GRAPHS IN CUBIC TIME
LINGAS, A
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1986, 210 : 98 - 103
[5] Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs
Kammer, Frank
Kratsch, Dieter
Laudahn, Moritz
[J]. ALGORITHMICA, 2019, 81 (03) : 1180 - 1204
[6] Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs
Frank Kammer
Dieter Kratsch
Moritz Laudahn
[J]. Algorithmica, 2019, 81 : 1180 - 1204
[7] Touching triangle represenations in a k-gon of biconnected outerplanar graphs
[J]. Aerts, Nieke, 1600, Springer Verlag (8871):
[8] Touching Triangle Represenations in a k-gon of Biconnected Outerplanar Graphs
Aerts, Nieke
[J]. GRAPH DRAWING (GD 2014), 2014, 8871 : 517 - 518
[9] SYNTHESIS OF BICONNECTED GRAPHS
BOESCH, FT
MCHUGH, JAM
[J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1974, CA21 (03): : 330 - 334
[10] OUTERPLANAR GRAPHS
MARTINOV, NJ
[J]. DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1978, 31 (03): : 265 - 267

← 1 2 3 4 5 →