Polyhedral consequences of the amalgam operation (Q1331977): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3222223 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3222886 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On certain polytopes associated with graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Compositions for perfect graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polyhedra for Composed Independence Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the facial structure of set packing polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3818127 / rank | |||
Normal rank |
Latest revision as of 17:31, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Polyhedral consequences of the amalgam operation |
scientific article |
Statements
Polyhedral consequences of the amalgam operation (English)
0 references
29 August 1994
0 references
The authors consider the amalgam \(G_ 1\varnothing G_ 2\) of two graphs \(G_ 1\) and \(G_ 2\) which has the property that if \(G_ 1\) and \(G_ 2\) are Meyniel graphs then their amalgam is also a Meyniel graph, and a similar conclusion holds for perfect graphs. In this paper this operation is studied from a polyhedral point of view. Using descriptions of the stable set polytopes \(P(G_ 1)\) and \(P(G_ 2)\) by means of valid linear inequalities, a complete description of \(P(G_ 1\varnothing G_ 2)\) is given. This result generalizes earlier results of a similar nature for other graph operations.
0 references
amalgam
0 references
Meyniel graph
0 references
perfect graphs
0 references
stable set polytopes
0 references