A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles (Q4312248): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:15, 6 February 2024
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
