Perfect matching cuts partitioning a graph into complementary subgraphs (Q2169960)

From MaRDI portal
Revision as of 00:00, 30 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Perfect matching cuts partitioning a graph into complementary subgraphs
scientific article

    Statements

    Perfect matching cuts partitioning a graph into complementary subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 August 2022
    0 references
    graph partitioning
    0 references
    complementary subgraphs
    0 references
    perfect matching
    0 references
    matching cut
    0 references
    graph isomorphism
    0 references

    Identifiers