Article ID Journal Published Year Pages File Type
4650095 Discrete Mathematics 2008 14 Pages PDF
Abstract

We prove that on (P7P7, banner)-free graphs the maximum weight stable set problem is solvable in polynomial time.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Stable sets of maximum weight in (P7P7, banner)-free graphs
Authors
,