Title of article
Polynomial algorithm for finding the largest independent sets in graphs without forks Original Research Article
Author/Authors
V.E. Alekseev، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
14
From page
3
To page
16
Abstract
A fork is a graph that is obtained from K1,3 by subdividing one edge. It is known that for K1,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.
Keywords
Independent set of vertices , Polynomial algorithm , Claw-free graphs , Graph
Journal title
Discrete Applied Mathematics
Serial Year
2004
Journal title
Discrete Applied Mathematics
Record number
885757
Link To Document