On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs (Q6396539)

From MaRDI portal
scientific article; zbMATH DE number 7604600
Language Label Description Also known as
English
On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs
scientific article; zbMATH DE number 7604600

    Statements

    14 April 2022
    0 references
    0 references
    math.CO
    0 references
    cs.CC
    0 references
    cs.DM
    0 references
    cs.DS
    0 references
    0 references
    0 references
    0 references
    0 references