The Graphs with All Subgraphs T-Perfect

DOI10.1137/S0895480196306361MaRDI QIDQ4210222zbMATH OpenFDO

Authors A. M. H. Gerards, F. Bruce Shepherd

Publication date 21 September 1998

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

zbMATH Keywords

\(t\)-perfect graphs

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• A new characterization of trivially perfect graphs
• Enumerative aspects of certain subclasses of perfect graphs
• scientific article; zbMATH DE number 846971
• scientific article; zbMATH DE number 861396
• scientific article; zbMATH DE number 733851
• The perfectly matchable subgraph polytope of an arbitrary graph
• Graph isomorphism completeness for perfect graphs and subclasses of perfect graphs
• Complementation in T-perfect graphs
• A new characterization of perfect graphs
• Domatically perfect graphs

Cited in

(12)

• On claw-free t-perfect graphs
• The \(\langle t \rangle \)-property of some classes of graphs
• The perfect \(T (G)\)-triple system for each subgraph \(G\) of \(K_5\) with eight edges
• Polyhedral techniques in combinatorial optimization I: Theory
• On cycles and the stable multi-set polytope
• \(t\)-perfection in \(P_5\)-free graphs
• 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
• Odd-\(K_{4}\)'s in stability critical graphs
• Claw-free \(t\)-perfect graphs can be recognized in polynomial time
• Characterising claw-free \(t\)-perfect graphs

This page was built for publication: The Graphs with All Subgraphs T-Perfect

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210222)