Degree sequence conditions for maximally edge-connected oriented graphs

If D is a digraph, delta(D) its minimum degree and; lambda(D) its edge-connectivity, then; lambda(D) <= delta(D). A digraph D is called maximally edge-connected if; lambda(D) = delta(D). A digraph without any directed cycle of length 2 is called an oriented graph. Sufficient conditions for digraphs to be maximally edge-connected have been given by several authors. However, closely related conditions for maximally edge-connected oriented graphs have received little attention until recently. In this work we will present some degree sequence conditions for oriented graphs as well as for oriented bipartite graphs to be maximally edge-connected. (c) 2006 Elsevier Ltd. All rights reserved.