𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Incrementing Bipartite Digraph Edge-Connectivity

✍ Scribed by Harold N. Gabow; Tibor Jordán

Book ID
110282445
Publisher
Springer US
Year
2000
Tongue
English
Weight
276 KB
Volume
4
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On super-edge-connected digraphs and bip
On super-edge-connected digraphs and bipartite digraphs
✍ M. A. Fiol 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 524 KB

## Abstract A maximally edge‐connected digraph is called super‐λ if every minimum edge disconnecting set is trivial, i.e., it consists of the edges adjacent to or from a given vertex. In this paper sufficient conditions for a digraph to be super‐λ are presented in terms of parameters such as diamet

Connectivity of large bipartite digraphs
Connectivity of large bipartite digraphs and graphs
✍ M.C. Balbuena; A. Carmona; J. Fàbrega; M.A. Fiol 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 638 KB

This paper studies the relation between the connectivity and other parameters of a bipartite (di)graph G. Namely, its order n, minimum degree 6, maximum degree A, diameter D, and a new parameter f related to the number of short paths in G. (When G is a bipartite -undirected --graph this parameter tu

Testingk-edge-connectivity of digraphs
Testingk-edge-connectivity of digraphs
✍ Yuichi Yoshida; Hiro Ito 📂 Article 📅 2010 🏛 Academy of Mathematics and Systems Science, Chines 🌐 English ⚖ 235 KB
Local Strongly Arc-Connectivity in Regul
Local Strongly Arc-Connectivity in Regular Bipartite Digraphs
✍ J.M. Xu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 99 KB

We show that for any vertex \(x\) of a \(d\)-regular bipartite digraph there are a vertex \(y\), in the other class of the bipartition, and \(d(x, y)\)-paths and \(d(y, x)\)-paths such that all \(2 d\) of them are pairwise arc-disjoint. This result generalizes a theorem of Hamidoune and Las Vergnas