t-perfection is always strong for claw-free graphs

dc.creator	Bruhn, Henning
dc.creator	Stein, Maya
dc.date.accessioned	2010-10-18T11:58:30Z
dc.date.available	2010-10-18T11:58:30Z
dc.date.created	2010-10-18T11:58:30Z
dc.date.issued	2010
dc.identifier	SIAM JOURNAL ON DISCRETE MATHEMATICS Volume: 24 Issue: 3 Pages: 770-781 Published: 2010
dc.identifier	0895-4801
dc.identifier	DOI: 10.1137/090769508
dc.identifier	https://repositorio.uchile.cl/handle/2250/125446
dc.description.abstract	A connected graph G is called t-perfect if its stable set polytope is determined by the non-negativity, edge and odd-cycle inequalities. More- over, G is called strongly t-perfect if this system is totally dual inte- gral. It is an open problem whether t-perfection is equivalent to strong t-perfection. We prove the equivalence for the class of claw-free graphs.
dc.language	en
dc.publisher	SIAM PUBLICATIONS
dc.subject	STABLE SET POLYTOPE
dc.title	t-perfection is always strong for claw-free graphs
dc.type	Artículo de revista