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 条

[31] Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor
Wollan, Paul
Wood, David R.
JOURNAL OF GRAPH THEORY, 2019, 91 (03) : 259 - 266
[32] Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls
Borradaile, Glencora
Chambers, Erin Wolf
DISCRETE & COMPUTATIONAL GEOMETRY, 2014, 51 (04) : 979 - 996
[33] Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls
Glencora Borradaile
Erin Wolf Chambers
Discrete & Computational Geometry, 2014, 51 : 979 - 996
[34] Packing, counting and covering Hamilton cycles in random directed graphs
Ferber, Asaf
Kronenberg, Gal
Long, Eoin
ISRAEL JOURNAL OF MATHEMATICS, 2017, 220 (01) : 57 - 87
[35] COVERING AND PACKING IN GRAPHS .5. MISPACKING SUBCUBES IN HYPERCUBES
GRAHAM, N
HARARY, F
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1988, 15 (04) : 267 - 270
[36] Packing and Covering Triangles in Bilaterally-Complete Tripartite Graphs
Amarnani, Naivedya
Burgos, Amaury De
Broughton, Wayne
GRAPHS AND COMBINATORICS, 2024, 40 (06)
[37] Packing, counting and covering Hamilton cycles in random directed graphs
Asaf Ferber
Gal Kronenberg
Eoin Long
Israel Journal of Mathematics, 2017, 220 : 57 - 87
[38] Packing and covering immersions in 4-edge-connected graphs
Liu, Chun-Hung
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2021, 151 : 148 - 222
[39] Covering spheres and balls with smaller balls
Dumer, Ilya
2006 IEEE International Symposium on Information Theory, Vols 1-6, Proceedings, 2006, : 992 - 996
[40] An O(log OPT)-Approximation for Covering/Packing Minor Models of θr
Chatzidimitriou, Dimitris
Raymond, Jean-Florent
Sau, Ignasi
Thilikos, Dimitrios M.
APPROXIMATION AND ONLINE ALGORITHMS, WAOA 2015, 2015, 9499 : 122 - 132

← 1 2 3 4 5 →