Well-covered claw-free graphs (Q1924128)
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: Well-covered claw-free graphs |
scientific article; zbMATH DE number 934795
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Well-covered claw-free graphs |
scientific article; zbMATH DE number 934795 |
Statements
Well-covered claw-free graphs (English)
0 references
23 March 1997
0 references
The existence of a polynomial algorithm, to tell whether a claw-free graph is well covered, is proved.
0 references
polynomial algorithm
0 references
claw-free graph
0 references
