On stable set polyhedra for K//(1,3)free graphs
type: Item
instance of: scholarly article
title: On stable set polyhedra for K//(1,3)free graphs
zbMATH Open document ID: 0494.05032
DOI: 10.1016/0095-8956(81)90033-2
author: Rick Giles
author: Leslie E. jun. Trotter
published in: Journal of Combinatorial Theory. Series B
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 3777533
zbMATH Keywords: stable set
zbMATH Keywords: facet
zbMATH Keywords: strong perfect graph conjecture
MaRDI profile type: Publication
full work available at URL: 0095-8956(81)90033-2
OpenAlex ID: W2039986023
cites work: Q3941433
cites work: Graphical properties related to minimal imperfection
cites work: Edmonds polytopes and a hierarchy of combinatorial problems
cites work: On the strong perfect graph conjecture
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Q5684698
cites work: Anti-blocking polyhedra
cites work: Q5685113
cites work: Q3218158
cites work: Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs
cites work: Normal hypergraphs and the perfect graph conjecture
cites work: A characterization of perfect graphs
cites work: On maximal independent sets of vertices in claw-free graphs
cites work: Properties of vertex packing and independence system polyhedra
cites work: On the facial structure of set packing polyhedra
cites work: Perfect zero–one matrices
cites work: Almost integral polyhedra related to certain combinatorial optimization problems
cites work: The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
cites work: A class of facet producing graphs for vertex packing polyhedra
cites work: Coloring a Family of Circular Arcs
cites work: Critical perfect graphs and perfect 3-chromatic graphs
cites work: Q3946199
description: scientific article; zbMATH DE number 3777533