Algorithmic and structural aspects of the P₃-Radon number
DOI10.1007/S10479-013-1320-9zbMATH Open1270.05062OpenAlexW2044122222MaRDI QIDQ363552FDOQ363552
Mitre C. Dourado, Dieter Rautenbach, Vinícius F. dos Santos, Jayme L. Szwarcfiter, Philipp M. Schäfer, Alexandre Toman
Publication date: 3 September 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-013-1320-9
Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convexity in Graphs and Hypergraphs
- The complexity of theorem-proving procedures
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Convex sets in graphs. II: Minimal path convexity
- On the Carathéodory Number for the Convexity of Paths of Order Three
- Irreversible conversion of graphs
- On two-path convexity in multipartite tournaments
- Embedding tournaments in simple tournaments
- Some remarks on simple tournaments
Cited In (6)
- An upper bound on the \(P_3\)-Radon number
- Characterization and recognition of Radon-independent sets in split graphs
- On the \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products
- Inapproximability results and bounds for the Helly and Radon numbers of a graph
- The Radon number of the three-dimensional integer lattice
- The convexity of induced paths of order three and applications: complexity aspects
This page was built for publication: Algorithmic and structural aspects of the \(P_3\)-Radon number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q363552)
