|
|||||
|
|
On α-redundant vertices in P5-free graphs |
|
| Authors: | Andreas Brandstä dtVan Bang Le |
| Affiliation: | Fachbereich Informatik, Universität Rostock, Albert-Einstein-Str. 21, 18051 Rostock, Germany |
| Abstract: | We prove that Maximum Stable Set can be solved in polynomial time on two new subclasses of P5-free graphs, extending some known polynomially solvable cases. |
| Keywords: | Maximum stable set problem P5-free graphs Polynomial time Graph algorithms |
| 本文献已被 ScienceDirect 等数据库收录！ | |