Stability number in subclasses of \(P_5\)-free graphs (Q1764380)
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: Stability number in subclasses of \(P_5\)-free graphs |
scientific article; zbMATH DE number 2138461
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stability number in subclasses of \(P_5\)-free graphs |
scientific article; zbMATH DE number 2138461 |
Statements
Stability number in subclasses of \(P_5\)-free graphs (English)
0 references
24 February 2005
0 references
The stability number or independence number of a graph \(G\) is the maximum cardinality among the independent sets of vertices of \(G\). The authors present two new hereditary classes of \(P_5\)-free graphs where the stability number can be found in polynomial time. These results generalize several known ones.
0 references
stability number
0 references
\(P_5\)-free graphs
0 references
polynomial algorithm
0 references
hereditary classes
0 references
0 references
