Dankelmann, Peter; Oellermann, Ortrud Degree sequences of optimally edge-connected multigraphs. (English) Zbl 1164.05334 Ars Comb. 77, 161-168 (2005). A multigraph is said to be optimally edge-connected if for every pair of vertices \(u,v\), the maximum number of edge-disjoint paths joining \(u\) to \(v\) equals the smaller of the degrees of \(u\) and \(v\). A multigraph with degree sequence \(D\) is called a realization of \(D\). The authors characterize the degree sequences that have an optimally edge-connected realization, as well as those for which every realization is optimally edge-connected. Reviewer: Tomáš Kaiser (Plzeň) Cited in 2 Documents MSC: 05C07 Vertex degrees 05C40 Connectivity Keywords:degree sequence; multigraph; optimally edge-connected PDFBibTeX XMLCite \textit{P. Dankelmann} and \textit{O. Oellermann}, Ars Comb. 77, 161--168 (2005; Zbl 1164.05334)