Show simple item record

dc.contributor.authorMahjoub, Ali Ridha
dc.date.accessioned2010-04-07T12:28:19Z
dc.date.available2010-04-07T12:28:19Z
dc.date.issued1997
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/3878
dc.language.isoenen
dc.subjectseparation problemen
dc.subjectPolytopesen
dc.subject2-edge connected graphsen
dc.subject.ddc003en
dc.titleOn perfectly two-edge connected graphsen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenThis paper studies the graphs for which the 2-edge connected spanning subgraph polytope is completely described by the trivial inequalities and the so-called cut inequalities. These graphs are called perfectly 2-edge connected. The class of perfectly 2-edge connected graphs contains for instance the class of series-parallel graphs. We introduce a new class of perfectly 2-edge connected graphs. We discuss some structural properties of graphs which are (minimally with respect to some reduction operations) nonperfectly 2-edge connected. Using this we give sufficient conditions for a graph to be perfectly 2-edge connected.en
dc.relation.isversionofjnlnameDiscrete Mathematics
dc.relation.isversionofjnlvol170en
dc.relation.isversionofjnlissue1-3en
dc.relation.isversionofjnldate1997-06
dc.relation.isversionofjnlpages153-172en
dc.relation.isversionofdoihttp://dx.doi.org/10.1016/S0012-365X(96)00004-0en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelRecherche opérationnelleen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record