TY - JOUR
T1 - Well-covered claw-free graphs
AU - Tankus, David
AU - Tarsi, Michael
PY - 1996/3
Y1 - 1996/3
N2 - We prove the existence of a polynomial time algorithm to tell whether a graph, with no induced subgraph isomorphic to K1.3, is well covered. A graph is well-covered if all its maximal independent sets are of the same cardinality. The problem is known to be polynomialy solvable where the input graph is a line graph and it is NP-hard for the larger family of all graphs which do not contain an induced subgraph isomorphic to K1,4.
AB - We prove the existence of a polynomial time algorithm to tell whether a graph, with no induced subgraph isomorphic to K1.3, is well covered. A graph is well-covered if all its maximal independent sets are of the same cardinality. The problem is known to be polynomialy solvable where the input graph is a line graph and it is NP-hard for the larger family of all graphs which do not contain an induced subgraph isomorphic to K1,4.
UR - http://www.scopus.com/inward/record.url?scp=0030099678&partnerID=8YFLogxK
U2 - 10.1006/jctb.1996.0022
DO - 10.1006/jctb.1996.0022
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0030099678
SN - 0095-8956
VL - 66
SP - 293
EP - 302
JO - Journal of Combinatorial Theory. Series B
JF - Journal of Combinatorial Theory. Series B
IS - 2
ER -