Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs (Q1959719): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:34, 1 February 2024
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
7 October 2010
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
