Characterization and recognition of Radon-independent sets in split graphs

DOI10.1016/J.IPL.2012.08.013MaRDI QIDQ1941699zbMATH OpenOpenAlexFDO

Authors Mitre C. Dourado, Dieter Rautenbach, Vinícius F. dos Santos, Jayme L. 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

graph algorithmssplit graphcombinatorial problemsgraph convexityRadon numberRadon partition

Mathematics Subject Classification ID

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

Recommendations

• An upper bound on the \(P_3\)-Radon number
• On the Radon number for \(P _{3}\)-convexity
• Algorithmic and structural aspects of the P₃-Radon number
• Radon numbers for trees
• Complexity aspects of the computation of the rank of a graph

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?)
• Algorithmic and structural aspects of the P₃-Radon number
• An upper bound on the \(P_3\)-Radon number
• Convex sets in graphs. II: Minimal path convexity
• Convexity in Graphs and Hypergraphs
• Embedding tournaments in simple tournaments
• Irreversible conversion of graphs
• Linear-time certifying recognition algorithms and forbidden induced subgraphs
• 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

Cited in

(1)

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

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

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