Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs (Q1959719): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00373-010-0939-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1967100434 / rank | |||
Normal rank | |||
Revision as of 23:12, 19 March 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
