| Author | dc.contributor.author | Bruhn, Henning | |
| Author | dc.contributor.author | Stein, Maya | es_CL |
| Admission date | dc.date.accessioned | 2010-10-18T11:58:30Z | |
| Available date | dc.date.available | 2010-10-18T11:58:30Z | |
| Publication date | dc.date.issued | 2010 | |
| Cita de ítem | dc.identifier.citation | SIAM JOURNAL ON DISCRETE MATHEMATICS Volume: 24 Issue: 3 Pages: 770-781 Published: 2010 | en_US |
| Identifier | dc.identifier.issn | 0895-4801 | |
| Identifier | dc.identifier.other | DOI: 10.1137/090769508 | |
| Identifier | dc.identifier.uri | https://repositorio.uchile.cl/handle/2250/125446 | |
| General note | dc.description | Univ Chile, Ctr Modelamiento Matemat, Santiago 2120, Chile | en_US |
| Abstract | 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. | en_US |
| Patrocinador | dc.description.sponsorship | The second author has been supported by Fondecyt grant no. 11090141. | en_US |
| Lenguage | dc.language.iso | en | en_US |
| Publisher | dc.publisher | SIAM PUBLICATIONS | en_US |
| Keywords | dc.subject | STABLE SET POLYTOPE | en_US |
| Título | dc.title | t-perfection is always strong for claw-free graphs | en_US |
| Document type | dc.type | Artículo de revista | |
