On the Radon Number for P 3-Convexity

DOI10.1007/978-3-642-29344-3_23zbMath1353.68280OpenAlexW1870932104MaRDI QIDQ2894471

Mitre C. Dourado, Dieter Rautenbach, Alexandre Toman, Jayme Luiz Szwarcfiter, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer

Publication date: 29 June 2012

Published in: LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29344-3_23

zbMATH Keywords

combinatoricsalgorithmsgraph theorycomplexity theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Axiomatic and generalized convexity (52A01) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

On the hull number on cycle convexity of graphs ⋮ Domination and convexity problems in the target set selection model ⋮ Graphs with few \(P_4\)'s under the convexity of paths of order three ⋮ Inapproximability results for graph convexity parameters

This page was built for publication: On the Radon Number for P 3-Convexity