Algorithmic and structural aspects of the P₃-Radon number

DOI10.1007/S10479-013-1320-9MaRDI QIDQ363552zbMATHOpenAlexFDO

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

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

zbMATH Keywords

graph convexityRadon numberRadon partition

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Recommendations

• On the Radon number for \(P _{3}\)-convexity
• An upper bound on the \(P_3\)-Radon number
• On the Carathéodory number for the convexity of paths of order three
• Radon numbers for trees
• On the Carathéodory number for the convexity of paths of order three

Cites work

• scientific article; zbMATH DE number 439012 (Why is no real title available?)
• scientific article; zbMATH DE number 3545692 (Why is no real title available?)
• Convex sets in graphs. II: Minimal path convexity
• Convexity in Graphs and Hypergraphs
• Embedding tournaments in simple tournaments
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• Irreversible conversion of graphs
• On the Carathéodory number for the convexity of paths of order three
• On two-path convexity in multipartite tournaments
• Some remarks on simple tournaments
• The complexity of theorem-proving procedures
• \(k\)-domination and \(k\)-independence in graphs: A survey

Cited in

(8)

• The Radon number of the three-dimensional integer lattice
• On the \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products
• Characterization and recognition of Radon-independent sets in split graphs
• On the Radon number for \(P _{3}\)-convexity
• An upper bound on the \(P_3\)-Radon number
• Radon numbers for trees
• Inapproximability results and bounds for the Helly and Radon numbers of a graph
• 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)