✦ LIBER ✦

Degree and local connectivity in digraphs

✍ Scribed by W. Mader

Book ID: 110564423
Publisher: Springer-Verlag
Year: 1985
Tongue: English
Weight: 289 KB
Volume: 5
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02579379

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Connectivity in digraphs

✍ L Lovász 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 185 KB

Locally-finite connected-homogeneous dig

Locally-finite connected-homogeneous digraphs

✍ Robert Gray; Rögnvaldur G. Möller 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 457 KB

Connectivity properties of locally semic

Connectivity properties of locally semicomplete digraphs

✍ Yubao Guo; Lutz Volkmann 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 548 KB

## Abstract It is shown that every __k__‐connected locally semicomplete digraph __D__ with minimum outdegree at least 2__k__ and minimum indegree at least 2__k__ − 2 has at least __m__ = max{2, __k__} vertices __x__~1~, __x__~2~, ⃛, __x__~__m__~ such that __D__ − __x__~__i__~ is __k__‐connected for

Weakly Hamiltonian-connected locally sem

Weakly Hamiltonian-connected locally semicomplete digraphs

✍ Bang-Jensen, J�rgen; Guo, Yubao; Volkmann, Lutz 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 630 KB

We characterize weakly hamiltonian-connected locally semicomplete digraphs.

Strongly Hamiltonian-connected locally s

Strongly Hamiltonian-connected locally semicomplete digraphs

✍ Guo, Yubao 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 513 KB

We give some sufficient conditions for locally semicomplete digraphs to contain a hamiltonian path from a prescribed vertex to another prescribed vertex. As an immediate consequence of these, we obtain that every 4-connected locally semicomplete digraph is strongly hamiltonian-connected. Our results