Title of article
Characterising claw-free t-perfect graphs
Author/Authors
Stein، نويسنده , , Maya and Bruhn، نويسنده , , Henning، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
7
From page
501
To page
507
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.
Keywords
Colouring , Claw-free Graphs , t-perfect graphs , stable set polytope (SSP)
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2009
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455190
Link To Document