The Graphs with All Subgraphs T-Perfect
From MaRDI portal
Publication:4210222
DOI10.1137/S0895480196306361zbMath0913.05083MaRDI QIDQ4210222
A. M. H. Gerards, F. Bruce Shepherd
Publication date: 21 September 1998
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Integer programming (90C10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Related Items (10)
Integer round-up property for the chromatic number of some \(h\)-perfect graphs ⋮ On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure ⋮ Complementation in T-perfect graphs ⋮ $t$-Perfection in $P_5$-Free Graphs ⋮ On claw-free \(t\)-perfect graphs ⋮ Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time ⋮ Polyhedral techniques in combinatorial optimization I: Theory ⋮ Odd-\(K_{4}\)'s in stability critical graphs ⋮ Characterising claw-free t-perfect graphs ⋮ On cycles and the stable multi-set polytope
This page was built for publication: The Graphs with All Subgraphs T-Perfect
