Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s00493-020-4423-3 | COMBINATORICA |
DocType | Volume | Issue |
Journal | 41 | 3 |
ISSN | Citations | PageRank |
0209-9683 | 0 | 0.34 |
References | Authors | |
0 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bousquet Nicolas | 1 | 0 | 0.34 |
| van Batenburg Wouter Cames | 2 | 0 | 0.34 |
| louis esperet | 3 | 148 | 24.86 |
| Gwenaël Joret | 4 | 196 | 28.64 |
| William Lochet | 5 | 0 | 2.37 |
| Muller Carole | 6 | 0 | 0.34 |
| Pirot François | 7 | 0 | 0.34 |