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 the normal view instead:
scientific article; zbMATH DE number 2138461
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8617368340492249
0 references
0.8456981778144836
0 references
0.8430832624435425
0 references
0.8389427065849304
0 references
0.8280336260795593
0 references
