PACKING AND COVERING BALLS IN GRAPHS EXCLUDING A MINOR

被引：1

作者：

Bousquet, Nicolas ^{[1
]}

Van Batenburg, Wouter Cames ^{[2
]}

Esperet, Louis ^{[1
]}

Joret, Gwenael ^{[2
]}

Lochet, William ^{[3
]}

Muller, Carole ^{[4
]}

Pirot, Francois ^{[1
,2
]}

机构：

[1] Univ Grenoble Alpes, Lab G SCOP, CNRS, Grenoble, France

[2] Univ Libre Bruxelles, Dept Informat, Brussels, Belgium

[3] Univ Bergen, Algorithms Res Grp, Bergen, Norway

[4] Univ Libre Bruxelles, Dept Math, Brussels, Belgium

来源：

COMBINATORICA | 2021年 / 41卷 / 03期

关键词：

05C10; 05C12; 05C65; 05C69; 05C83;

D O I：

10.1007/s00493-020-4423-3

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We prove that for every integer t > 1 there exists a constant c(t) such that for every K-t-minor-free graph G, and every set S of balls in G, the minimum size of a set of vertices of G intersecting all the balls of S is at most c(t) times the maximum number of vertex-disjoint balls in S. This was conjectured by Chepoi, Estellon, and Vaxes in 2007 in the special case of planar graphs and of balls having the same radius.

引用

页码：299 / 318

页数：20

共 50 条

[21] Defective Colouring of Graphs Excluding A Subgraph or Minor
De Mendez, Patrice Ossona
Oum, Sang-Il
Wood, David R.
COMBINATORICA, 2019, 39 (02) : 377 - 410
[22] Triangle packing and covering in dense random graphs
Tang, Zhongzheng
Diao, Zhuo
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (04) : 3153 - 3164
[23] Triangle packing and covering in dense random graphs
Zhongzheng Tang
Zhuo Diao
Journal of Combinatorial Optimization, 2022, 44 : 3153 - 3164
[24] Improved Sparse Covers for Graphs Excluding a Fixed Minor
Busch, Costas
LaFortune, Ryan
Tirthapura, Srikanta
PODC'07: PROCEEDINGS OF THE 26TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2007, : 61 - 70
[25] An improved decomposition theorem for graphs excluding a fixefd minor
Fakcharoenphol, J
Talwar, K
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION, 2003, 2764 : 36 - 46
[26] Simple PTAS's for families of graphs excluding a minor
Cabello, Sergio
Gajser, David
DISCRETE APPLIED MATHEMATICS, 2015, 189 : 41 - 48
[27] Packing minor-closed families of graphs into complete graphs
Messuti, Silvia
Rodl, Vojtech
Schacht, Mathias
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 119 : 245 - 265
[28] COVERING AND PACKING IN GRAPHS .4. LINEAR ARBORICITY
AKIYAMA, J
EXOO, G
HARARY, F
NETWORKS, 1981, 11 (01) : 69 - 72
[29] Packing and Covering Immersion Models of Planar Subcubic Graphs
Giannopoulou, Archontia C.
Kwon, O-joung
Raymond, Jean-Florent
Thilikos, Dimitrios M.
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2016, 2016, 9941 : 74 - 84
[30] Compact routing for graphs excluding a fixed minor (Extended abstract)
Abraham, I
Gavoille, C
Malkhi, D
DISTRIBUTED COMPUTING, PROCEEDINGS, 2005, 3724 : 442 - 456

← 1 2 3 4 5 →