On α-redundant vertices in P5-free graphs

Information Processing Letters

Volumn 82, Issue 3, 2002, Pages 119-122

  Brandstädt, Andreas ^a   Le, Hoàng Oanh ^a   Le, Van Bang ^a  

^a UNIVERSITY OF ROSTOCK   (Germany)

Author keywords

Graph algorithms; Maximum stable set problem; P5 free graphs; Polynomial time

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

MAXIMUM STABLE SET PROBLEM;

GRAPH THEORY;

EID: 0037118193     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00265-4     Document Type: Article

References (8)

1. On the number of maximal stable sets in graphs from hereditary classes
2. On graphs with polynomially solvable maximum-weight clique problem
3. A note on α-redundant vertices in graphs
4. 5-free graphs
5. 5̄)-free graphs
6. 5-free graphs