On perfectly two-edge connected graphs
type: Item
instance of: scholarly article
title: On perfectly two-edge connected graphs
zbMATH Open document ID: 0882.90125
DOI: 10.1016/S0012-365X(96)00004-0
author: A. R. Mahjoub
published in: Discrete Mathematics
publication date: 1998-02-24T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 52B12
zbMATH DE Number: 1047051
zbMATH Keywords: separation problem
zbMATH Keywords: 2-edge connected spanning subgraph polytope
MaRDI profile type: Publication
cites work: On two-connected subgraph polytopes
cites work: The k-Edge-Connected Spanning Subgraph Polyhedron
cites work: Q3929516
cites work: The traveling salesman problem on a graph and some related integer polyhedra
cites work: The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
cites work: Q5624995
cites work: Topology of series-parallel networks
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows
cites work: The traveling salesman problem in graphs with some excluded minors
cites work: Maximal Flow Through a Network
cites work: On the relationship between the biconnectivity augmentation and traveling salesman problems
cites work: Survivable networks, linear programming relaxations and the parsimonious property
cites work: Q3328286
cites work: Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
cites work: Q4035361
cites work: Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
cites work: Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
cites work: Q3677509
cites work: Two-edge connected spanning subgraphs and polyhedra
cites work: Minimum-weight two-connected spanning networks
cites work: The traveling salesman problem: An update of research
cites work: Q4845372
cites work: Steiner problem in Halin networks
cites work: Generalized steiner problem in series-parallel networks
Recommended article: Q3691701
Recommended article: On Graphs with Proper Connection Number 2
Recommended article: On the two‐edge‐colorings of perfect graphs
Recommended article: On ‐connected graphs
Recommended article: Two classes of perfect graphs
Recommended article: Two conjectures equivalent to the perfect graph conjecture
Recommended article: On edge perfectness and classes of bipartite graphs
Recommended article: On the perfect graph conjecture
Recommended article: On critically perfect graphs
Recommended article: Q4278906
description: scientific article; zbMATH DE number 1047051