On the Radon number for P _3-convexity

DOI10.1007/978-3-642-29344-3_23MaRDI QIDQ2894471zbMATH OpenOpenAlexFDO

Authors Mitre C. Dourado, Dieter Rautenbach, Alexandre Toman, Vinícius F. dos Santos, Philipp M. Schäfer, Jayme L. Szwarcfiter

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

algorithmscombinatoricsgraph theorycomplexity theory

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) 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)

Recommendations

• Algorithmic and structural aspects of the P₃-Radon number
• An upper bound on the \(P_3\)-Radon number
• Radon numbers for trees
• On the Carathéodory number for the convexity of paths of order three
• On the Carathéodory number for the convexity of paths of order three

Cited in

(11)

• An upper bound on the \(P_3\)-Radon number
• Radon numbers for trees
• Characterization and recognition of Radon-independent sets in split graphs
• Star-shape, Radon number, and minty graphs
• On the hull number on cycle convexity of graphs
• The Radon number of the three-dimensional integer lattice
• On the geodetic Radon number of grids
• Graphs with few \(P_4\)'s under the convexity of paths of order three
• Inapproximability results for graph convexity parameters
• Algorithmic and structural aspects of the P₃-Radon number
• Domination and convexity problems in the target set selection model

This page was built for publication: On the Radon number for \(P _{3}\)-convexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894471)