Matching cut in graphs with large minimum degree (Q5925521)

From MaRDI portal
scientific article; zbMATH DE number 7335022
Language Label Description Also known as
English
Matching cut in graphs with large minimum degree
scientific article; zbMATH DE number 7335022

    Statements

    Matching cut in graphs with large minimum degree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 April 2021
    0 references
    0 references
    matching cut
    0 references
    graph algorithm
    0 references
    exact branching algorithm
    0 references
    NP-hard problem
    0 references
    0 references