On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs (Q5236167)

From MaRDI portal
Revision as of 01:01, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7117325
Language Label Description Also known as
English
On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs
scientific article; zbMATH DE number 7117325

    Statements

    On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs (English)
    0 references
    15 October 2019
    0 references
    0 references
    double vertex-edge domination
    0 references
    chordal graph
    0 references
    proper interval graph
    0 references
    NP-complete
    0 references
    APX-complete
    0 references
    0 references