The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds

DOI10.1002/NET.1975.5.3.253MaRDI QIDQ4073398zbMATH OpenOpenAlexFDO

Authors Robert E. Bixby

Publication date 1975

Published in Networks (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.bams/1183535702

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Cited in

(19)

• Linear programs for constraint satisfaction problems
• A decomposition theory for matroids. I: General results
• On the cut polyhedron.
• Chords and disjoint paths in matroids
• Counting almost minimum cutsets with reliability applications
• A characterization of a class of non-binary matroids
• Transformations Enlarging the Network Portion of a Class or LP/Embedded Generalized Networks
• Characterizing the flow equivalent trees of a network
• Extracting maximal information about sets of minimum cuts
• Canonical decompositions of symmetric submodular systems
• Central Limit Theorems for Sums of Wick Products of Stationary Sequences
• Graphs with largest number of minimum cuts
• Integer programs for logic constraint satisfaction
• Canonical cactus representation for miminum cuts
• Paroids: A canonical format for combinatorial optimization
• On chains of 3-connected matroids
• Bounds on the Reliability Polynomial for Shellable Independence Systems
• The incidence structure of subspaces with well-scaled frames
• Reliable assignments of processors to tasks and factoring on matroids

This page was built for publication: The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4073398)