The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds
From MaRDI portal
Publication:4073398
DOI10.1002/net.1975.5.3.253zbMath0314.05106OpenAlexW108232731MaRDI QIDQ4073398
Publication date: 1975
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.bams/1183535702
Related Items
Transformations Enlarging the Network Portion of a Class or LP/Embedded Generalized Networks, On chains of 3-connected matroids, Canonical cactus representation for miminum cuts, The incidence structure of subspaces with well-scaled frames, A characterization of a class of non-binary matroids, Graphs with largest number of minimum cuts, Counting almost minimum cutsets with reliability applications, On the cut polyhedron., Integer programs for logic constraint satisfaction, Reliable assignments of processors to tasks and factoring on matroids, Paroids: A canonical format for combinatorial optimization, Central Limit Theorems for Sums of Wick Products of Stationary Sequences, Chords and disjoint paths in matroids, Extracting maximal information about sets of minimum cuts, Characterizing the flow equivalent trees of a network, Canonical decompositions of symmetric submodular systems, Linear programs for constraint satisfaction problems, Bounds on the Reliability Polynomial for Shellable Independence Systems, A decomposition theory for matroids. I: General results
