Small feedback vertex sets inplanar digraphs

被引：0

作者：

Esperet, Louis ^{[1
]}

Lemoine, Laetitia

Maffray, Frederic

机构：

[1] CNRS, G SCOP, Grenoble, France

来源：

ELECTRONIC JOURNAL OF COMBINATORICS | 2017年 / 24卷 / 02期

关键词：

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let G be a directed planar graph on nn vertices, with no directed cycle of length less than g >= 4. We prove that G contains a set X of vertices such that G-X has no directed cycle, and |X|<= 5n-5/9 if g = 4, |X| <= 2n-5/4 if g = 5, and |X| <= 2n-6/g if g >= 6. This improves recent results of Golowich and Rolnick.

引用

页数：5

共 50 条

[31] ON VERTEX SYMMETRIC DIGRAPHS
MARUSIC, D
DISCRETE MATHEMATICS, 1981, 36 (01) : 69 - 81
[32] Improved bounds for minimal feedback vertex sets in tournaments
Mnich, M.
Teutrine, E.
JOURNAL OF GRAPH THEORY, 2018, 88 (03) : 482 - 506
[33] Minimum weight feedback vertex sets in circle graphs
Gavril, Fanica
INFORMATION PROCESSING LETTERS, 2008, 107 (01) : 1 - 6
[34] A min-max theorem on feedback vertex sets
Cai, MC
Deng, XT
Zang, WN
MATHEMATICS OF OPERATIONS RESEARCH, 2002, 27 (02) : 361 - 371
[35] FEEDBACK VERTEX SETS AND CYCLICALLY REDUCIBLE GRAPHS.
Wang, Ching-Chy
Lloyd, Errol L.
Soffa, Mary Lou
Journal of the ACM, 1985, 32 (02): : 296 - 313
[36] MINIMUM FEEDBACK ARC AND VERTEX SETS OF A DIRECTED GRAPH
LEMPEL, A
CEDERBAUM, I
IEEE TRANSACTIONS ON CIRCUIT THEORY, 1966, CT13 (04): : 399 - +
[37] Circular convex bipartite graphs: Feedback vertex sets
Liu, Tian
Lu, Min
Lu, Zhao
Xu, Ke
THEORETICAL COMPUTER SCIENCE, 2014, 556 : 55 - 62
[38] Feedback Vertex Set of Generalized De Brulin Digraphs GB(d, n)
Xu, Xirong
Yang Yuansheng
Ming, Di
UTILITAS MATHEMATICA, 2009, 79 : 107 - 124
[39] Tractable Feedback Vertex Sets in Restricted Bipartite Graphs
Jiang, Wei
Liu, Tian
Xu, Ke
COMBINATORIAL OPTIMIZATION AND APPLICATIONS, 2011, 6831 : 424 - +
[40] Dynamic monopolies and feedback vertex sets in hexagonal grids
Adams, Sarah Spence
Troxell, Denise Sakai
Zinnen, S. Luke
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2011, 62 (11) : 4049 - 4057

← 1 2 3 4 5 →