| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652389 | Electronic Notes in Discrete Mathematics | 2009 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
