Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs (Q1959719)

From MaRDI portal
Revision as of 17:34, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs
scientific article

    Statements

    Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs (English)
    0 references
    0 references
    0 references
    7 October 2010
    0 references
    0 references
    \({\mathcal{P}_3}\)-dominated graphs
    0 references
    1-tough graph
    0 references
    perfect matching
    0 references
    factor-criticality
    0 references
    \(p\)-extendable graph
    0 references