Strong T-Perfection of Bad-K4 -Free Graphs
From MaRDI portal
Publication:4785692
DOI10.1137/S0895480101401101zbMath1007.05056MaRDI QIDQ4785692
No author found.
Publication date: 5 January 2003
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)
Related Items (3)
On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure ⋮ Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time ⋮ Odd-\(K_{4}\)'s in stability critical graphs
This page was built for publication: Strong T-Perfection of Bad-K4 -Free Graphs
