Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs (Q1959719)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs |
scientific article; zbMATH DE number 5797146
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs |
scientific article; zbMATH DE number 5797146 |
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
