A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles (Q4312248)
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: A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles |
scientific article; zbMATH DE number 682532
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles |
scientific article; zbMATH DE number 682532 |
Statements
A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles (English)
0 references
4 April 1995
0 references
characterization
0 references
independent set
0 references
well-covered graph
0 references
cycles
0 references
extendable vertex
0 references
polynomial time
0 references
