×
Jan 11, 2011 · A graph is called t-perfect, if its stable set polytope is defined by non-negativity, edge and odd-cycle inequalities.
A graph is called t-perfect, if its stable set polytope is defined by non- negativity, edge and odd-cycle inequalities. We characterise the class of all claw- ...
A graph is called t-perfect, if its stable set polytope is defined by non- negativity, edge and odd-cycle inequalities. We characterise the class of all claw- ...
A graph is called t-perfect, if its stable set polytope is defined by non-negativity, edge and odd-cycle inequalities. We characterise the class of all ...
The class of all claw-free t-perfect graphs by forbidden t-minors is characterised, and it is shown that they are 3-colourable. A graph is called t-perfect, ...
Jun 8, 2015 · Claw-free perfect graphs can be decomposed via clique-cutset into two special classes called elementary graphs and peculiar graphs. Based on ...
Missing: t- | Show results with:t-
We characterise the class of all claw-free t-perfect graphs by forbidden t-minors, and show that they are 3-colourable. Moreover, we determine the chromatic ...
A graph is called $t$-perfect if its stable set polytope is defined by nonnegativity, edge, and odd-cycle inequalities. We show that it can be decided in ...
Abstract A graph is called t-perfect, if its stable set polytope is defined by non- negativity, edge and odd-cycle inequalities. We characterise the class ...
Oct 30, 2013 · Abstract:A graph is called t-perfect if its stable set polytope is defined by non-negativity, edge and odd-cycle inequalities.