On perfectly two-edge connected graphs
From MaRDI portal
Publication:1363658
DOI10.1016/S0012-365X(96)00004-0zbMATH Open0882.90125MaRDI QIDQ1363658FDOQ1363658
Publication date: 24 February 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 3916310
- On Graphs with Proper Connection Number 2
- On the two‐edge‐colorings of perfect graphs
- On ‐connected graphs
- Two classes of perfect graphs
- Two conjectures equivalent to the perfect graph conjecture
- On edge perfectness and classes of bipartite graphs
- On the perfect graph conjecture
- On critically perfect graphs
- scientific article; zbMATH DE number 500364
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Cites Work
- Maximal Flow Through a Network
- The traveling salesman problem on a graph and some related integer polyhedra
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Title not available (Why is that?)
- Maximum matching and a polyhedron with 0,1-vertices
- Title not available (Why is that?)
- Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
- Title not available (Why is that?)
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Minimum-weight two-connected spanning networks
- Steiner problem in Halin networks
- On the relationship between the biconnectivity augmentation and traveling salesman problems
- Topology of series-parallel networks
- Title not available (Why is that?)
- The k-Edge-Connected Spanning Subgraph Polyhedron
- Two-edge connected spanning subgraphs and polyhedra
- On two-connected subgraph polytopes
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Survivable networks, linear programming relaxations and the parsimonious property
- The traveling salesman problem: An update of research
- Title not available (Why is that?)
- Generalized steiner problem in series-parallel networks
- The traveling salesman problem in graphs with some excluded minors
- Title not available (Why is that?)
- The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
Cited In (13)
- A branch-and-cut algorithm for the k-edge connected subgraph problem
- Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron
- On ‐connected graphs
- The 2-edge-connected subgraph polyhedron
- Survivability in hierarchical telecommunications networks
- On the dominant of the Steiner 2-edge connected subgraph polytope
- Two classes of perfect graphs
- Title not available (Why is that?)
- The box-TDI system associated with 2-edge connected spanning subgraphs
- On edge perfectness and classes of bipartite graphs
- Critical extreme points of the 2-edge connected spanning subgraph polytope
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
- Box-total dual integrality and edge-connectivity
This page was built for publication: On perfectly two-edge connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363658)
