The maximum weight stable set problem in (P₆,mbox{bull})-free graphs
classification
🧮 math.CO
cs.DM
keywords
bullgraphinducedmaximumstableverticesweightalgorithm
read the original abstract
We present a polynomial-time algorithm that finds a maximum weight stable set in a graph that does not contain as an induced subgraph an induced path on six vertices or a bull (the graph with vertices $a, b, c, d, e$ and edges $ab, bc, cd, be, ce$).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.