The complexity of the matching-cut problem for planar graphs and other graph classes (Q3652545)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of the matching-cut problem for planar graphs and other graph classes
scientific article

    Statements

    Identifiers

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