Pages that link to "Item:Q878065"
From MaRDI portal
The following pages link to Covering planar graphs with a fixed number of balls (Q878065):
Displaying 15 items.
- Covering nearly surface-embedded graphs with a fixed number of balls (Q741614) (← links)
- Problems from CGCS Luminy, May 2007 (Q966173) (← links)
- Packing and covering balls in graphs excluding a minor (Q2043760) (← links)
- Packing and covering with balls on Busemann surfaces (Q2358828) (← links)
- VC-dimension and Erdős-Pósa property (Q2515568) (← links)
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs (Q2662795) (← links)
- Approximating maximum diameter-bounded subgraph in unit disk graphs (Q2665266) (← links)
- Beyond Helly graphs: the diameter problem on absolute retracts (Q2672446) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs (Q5103874) (← links)
- Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs (Q5115768) (← links)
- The degree/diameter problem in maximal planar bipartite graphs (Q5890615) (← links)
- The degree/diameter problem in maximal planar bipartite graphs (Q5965484) (← links)
- Sample Compression Schemes for Balls in Graphs (Q6069434) (← links)
- A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
