Polynomial time recognition of essential graphs having stability number equal to matching number (Q497363)
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: Polynomial time recognition of essential graphs having stability number equal to matching number |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time recognition of essential graphs having stability number equal to matching number |
scientific article |
Statements
Polynomial time recognition of essential graphs having stability number equal to matching number (English)
0 references
24 September 2015
0 references
maximum stable set
0 references
maximum matching
0 references
polynomial time algorithm
0 references
