On the b-Stable Set Polytope of Graphs without Bad K4

DOI10.1137/S0895480102417343zbMath1029.05115OpenAlexW2160804571MaRDI QIDQ4443105

Dion C. Gijswijt

Publication date: 8 January 2004

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480102417343

zbMATH Keywords

graphstable setpolytope\(t\)-perfect

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

On cycles and the stable multi-set polytope

This page was built for publication: On the b-Stable Set Polytope of Graphs without Bad K₄