Construction of a Maximally Edge‐Connected Graph with Prescribed Degrees

Let 〈 d 1 , d 2 ,..., d p ,〉 be a realizable degree sequence, d i ⩾2; then a graph G can be constructed so that deg( v i and so that for i ≠ j , the number of edge‐disjoint paths between v i and v j is ( d i , d j ).