Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903030 | Discrete Mathematics | 2018 | 10 Pages |
Abstract
We give a polynomial time algorithm that finds the maximum weight stable set in a graph that does not contain an induced path on seven vertices or a bull (the graph with vertices a,b,c,d,e and edges ab,bc,cd,be,ce). With the same arguments we also give a polynomial algorithm for any graph that does not contain S1,2,3 or a bull.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Frédéric Maffray, Lucas Pastor,