On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs (Q510982): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5393667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreversible conversion of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convexity of Paths of Length Two in Undirected Graphs / 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: The hull number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs / rank
 
Normal rank

Latest revision as of 09:58, 13 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs
scientific article

    Statements

    On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs (English)
    0 references
    0 references
    0 references
    0 references
    14 February 2017
    0 references
    \(P_3\)-convexity
    0 references
    \(P_3\)-hull number
    0 references
    Cartesian product
    0 references

    Identifiers

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