Abstract
A fork is a graph that is obtained from K 1,3 by subdividing one edge. It is known [6–8] that for K 1,3-free graphs the problem of finding the largest independent set can be solved in a polynomial time. In this paper, we prove that this is also true for the wider class of fork-free graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
