Now showing items 1-1 of 1
Cycle decompositions and t-perfect graphs
(Universität Ulm, 2017-10-18)
The thesis is divided into two parts. The first part deals with t-perfect graphs. A graph is called t-perfect if its stable set polytope is fully described by non-negativity, edge and odd-cycle constraints. We give ...