Characterising claw-free t-perfect graphs
Abstract
We characterise the class of all claw-free t-perfect graphs by forbidden t-minors. Moreover, we show that claw-free t-perfect graphs are 3-colourable. Such a colouring can be obtained in polynomial time. © 2009 Elsevier B.V. All rights reserved.
Más información
Título según SCOPUS: | Characterising claw-free t-perfect graphs |
Título de la Revista: | Electronic Notes in Discrete Mathematics |
Volumen: | 34 |
Editorial: | Elsevier |
Fecha de publicación: | 2009 |
Página de inicio: | 501 |
Página final: | 507 |
Idioma: | eng |
URL: | http://www.scopus.com/inward/record.url?eid=2-s2.0-67651155940&partnerID=q2rCbXpz |
DOI: |
10.1016/j.endm.2009.07.083 |
Notas: | SCOPUS - ISI |