Characterising claw-free t-perfect graphs

DOI10.1016/j.endm.2009.07.083zbMath1273.05188OpenAlexW2075007616MaRDI 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

zbMATH Keywords

colouringclaw-free graphs\(t\)-perfect graphsstable set polytope (SSP)

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

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

This page was built for publication: Characterising claw-free t-perfect graphs