Characterization and recognition of Radon-independent sets in split graphs

DOI10.1016/j.ipl.2012.08.013zbMath1259.05138OpenAlexW2151594181MaRDI QIDQ1941699

Dieter Rautenbach, Mitre C. Dourado, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter

Publication date: 21 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.08.013

zbMATH Keywords

split graphcombinatorial problemsgraph algorithmsgraph convexityRadon numberRadon partition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

And/or-convexity: a graph convexity based on processes and deadlock models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithmic and structural aspects of the \(P_3\)-Radon number
• An upper bound on the \(P_3\)-Radon number
• Irreversible conversion of graphs
• Convex sets in graphs. II: Minimal path convexity
• On two-path convexity in multipartite tournaments
• Embedding tournaments in simple tournaments
• Some remarks on simple tournaments
• Convexity in Graphs and Hypergraphs
• On the Carathéodory Number for the Convexity of Paths of Order Three

This page was built for publication: Characterization and recognition of Radon-independent sets in split graphs