Inapproximability results and bounds for the Helly and Radon numbers of a graph (Q2410232): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexity results related to monophonic convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the \(P_3\)-Radon number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic and structural aspects of the \(P_3\)-Radon number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex sets in graphs. II: Minimal path convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4274009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on simple tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity in Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open packing, total domination, and the \(P_3\)-Radon number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Helly theorem for convexity in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodesic Convexity in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of Radon's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Latest revision as of 13:25, 14 July 2024

scientific article
Language Label Description Also known as
English
Inapproximability results and bounds for the Helly and Radon numbers of a graph
scientific article

    Statements

    Inapproximability results and bounds for the Helly and Radon numbers of a graph (English)
    0 references
    0 references
    0 references
    17 October 2017
    0 references
    bipartite graphs
    0 references
    geodetic convexity
    0 references
    Helly number
    0 references
    inapproximability
    0 references
    Radon number
    0 references
    upper bound
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references