On the computational complexity of the Helly number in the \(P_3\) and related convexities (Q2132356): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Carathéodory number of the \(P_3\) convexity of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity aspects of the Helly property: graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results related to monophonic convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3615800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-\(d\) independent set problems for bipartite and chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite Domination and Simultaneous Matroid Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size / rank
 
Normal rank
Property / cites work
 
Property / cites work: The P k Partition Problem and Related Problems in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability results for the maximum and minimum maximal induced matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local majorities, coalitions and monopolies in graphs: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of some generalizations of the maximum matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in hereditary classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An induced subgraph characterization of domination perfect graphs / rank
 
Normal rank

Latest revision as of 19:26, 28 July 2024

scientific article
Language Label Description Also known as
English
On the computational complexity of the Helly number in the \(P_3\) and related convexities
scientific article

    Statements

    On the computational complexity of the Helly number in the \(P_3\) and related convexities (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 April 2022
    0 references
    cliques
    0 references
    dominating and independent sets
    0 references
    \(P_3\)-Helly-independent
    0 references

    Identifiers