Characterising claw-free t-perfect graphs
From MaRDI portal
Publication:2851509
DOI10.1016/j.endm.2009.07.083zbMath1273.05188MaRDI QIDQ2851509
Henning Bruhn, Maya Jakobine Stein
Publication date: 10 October 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.083
05C75: Structural characterization of families of graphs
Cites Work
- On claw-free \(t\)-perfect graphs
- A class of h-perfect graphs
- The strong perfect graph theorem
- On the stable set polytope of a series-parallel graph
- Polytope des independants d'un graphe série-parallèle
- On certain polytopes associated with graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Coloring quasi-line graphs
- Transformations which Preserve Perfectness and H-Perfectness of Graphs
- The Graphs with All Subgraphs T-Perfect
- Compositions of Graphs and Polyhedra II: Stable Sets
- Maximum matching and a polyhedron with 0,1-vertices