Complementation in T-perfect graphs
From MaRDI portal
Publication:2672429
DOI10.1007/978-3-030-86838-3_8OpenAlexW3202970361MaRDI QIDQ2672429
Publication date: 8 June 2022
Full work available at URL: https://arxiv.org/abs/2104.14935
Cites Work
- Unnamed Item
- Unnamed Item
- On claw-free \(t\)-perfect graphs
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
- The strong perfect graph theorem
- Relaxations of vertex packing
- Polytope des independants d'un graphe série-parallèle
- Combinatorial designs related to the strong perfect graph conjecture
- On certain polytopes associated with graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Applying Lehman's theorems to packing problems
- Normal hypergraphs and the perfect graph conjecture
- t-Perfection Is Always Strong for Claw-Free Graphs
- Transformations which Preserve Perfectness and H-Perfectness of Graphs
- Vertex packings: Structural properties and algorithms
- The Graphs with All Subgraphs T-Perfect
- Properties of vertex packing and independence system polyhedra
- Perfect zero–one matrices
- $t$-Perfection in $P_5$-Free Graphs
This page was built for publication: Complementation in T-perfect graphs
