Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3 (Q2297715)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3
scientific article

    Statements

    Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3 (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 February 2020
    0 references
    forbidden subgraph
    0 references
    perfect matching
    0 references
    \(k\)-extendable graph
    0 references

    Identifiers