Stability in P5- and banner-free graphs

Stability in P5- and banner-free graphs

0.00 Avg rating—0 Votes
Article ID: iaor20011470
Country: Netherlands
Volume: 125
Issue: 2
Start Page Number: 292
End Page Number: 297
Publication Date: Sep 2000
Journal: European Journal of Operational Research
Authors:
Keywords: computational analysis
Abstract:

We prove polynomial solvability of the maximum stable set problem in P5-free banner-free ((P5,B)-free) graphs, where P5 is the simple path on five vertices and a banner is the graph with vertices a,b,c,d,e and edges (a,b),(b,c),(b,d),(c,e),(d,e).

Reviews

Required fields are marked *. Your email address will not be published.