Title of article
Composition of graphs and the triangle free subgraph polytope
Author/Authors
Bendali، نويسنده , , F. and Mahjoub، نويسنده , , A.R. and Mailfert، نويسنده , , J.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
4
From page
19
To page
22
Abstract
Given a graph G which decomposes into two graphs G1 and G2 by means of a 3-sum, we derive a linear system of inequalities that defines the triangle free subgraph polytope from two systems related to G1 and G2. This yields a method to characterize this polytope for graphs that decompose this way. A procedure is given to describe new facets for this polytope. We also show that this system is TDI if the systems for the pieces are also TDI. Some applications of these results will be discussed.
Keywords
Composition of polyhedra , 3-sum , k3-cover , triangle free subgraph polytope
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2000
Journal title
Electronic Notes in Discrete Mathematics
Record number
1452815
Link To Document