Inapproximability results and bounds for the Helly and Radon numbers of a graph
DOI10.1016/J.DAM.2017.07.032zbMATH Open1372.05051OpenAlexW2753661467MaRDI QIDQ2410232FDOQ2410232
Authors: Mitre C. Dourado, Aline R. da Silva 
Publication date: 17 October 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.07.032
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Planar graphs; geometric and topological aspects of graph theory (05C10) Helly-type theorems and geometric transversal theory (52A35)
Cites Work
- Title not available (Why is that?)
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Title not available (Why is that?)
- Convexity in Graphs and Hypergraphs
- Convex sets in graphs. II: Minimal path convexity
- Open packing, total domination, and the \(P_3\)-Radon number
- Geodesic Convexity in Graphs
- Title not available (Why is that?)
- An upper bound on the \(P_3\)-Radon number
- A Helly theorem for convexity in graphs
- Complexity results related to monophonic convexity
- A Generalization of Radon's Theorem
- Some remarks on simple tournaments
- Algorithmic and structural aspects of the \(P_3\)-Radon number
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Inapproximability results and bounds for the Helly and Radon numbers of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2410232)
