The Graphs with All Subgraphs T-Perfect
From MaRDI portal
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
(13)- Odd-\(K_{4}\)'s in stability critical graphs
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs
- On cycles and the stable multi-set polytope
- On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure
- Complementation in T-perfect graphs
- Claw-free t-perfect graphs can be recognized in polynomial time
- Characterising claw-free t-perfect graphs
- The perfect T (G)-triple system for each subgraph G of K₅ with eight edges
- On claw-free t-perfect graphs
- Polyhedral techniques in combinatorial optimization I: Theory
- \(t\)-perfection in \(P_5\)-free graphs
- On fork-free t-perfect graphs
- The \(\langle t \rangle \)-property of some classes of 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)
