✦ LIBER ✦

Local Strongly Arc-Connectivity in Regular Bipartite Digraphs

✍ Scribed by J.M. Xu

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 99 KB
Volume: 59
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1064

No coin nor oath required. For personal study only.

✦ Synopsis

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 for graphs. 1993 Academic Press, Inc.

📜 SIMILAR VOLUMES

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

Some remarks on Arc-connectivity, vertex

Some remarks on Arc-connectivity, vertex splitting, and orientation in graphs and digraphs

✍ Bill Jackson 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 309 KB

We apply proof techniques developed by L. Lovasz and A. Frank to obtain several results on the arc-connectivity of graphs and digraphs. The first results concern the operation of splitting two arcs from a vertex of an Eulerian graph or digraph in such a way as to preserve local connectivity conditio

Solution of a conjecture of Volkmann on

Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments

✍ Dirk Meierling 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 1 views

## Abstract An in‐tournament is an oriented graph such that the negative neighborhood of every vertex induces a tournament. Let __m__ = 4 or __m__ = 5 and let __D__ be a strongly connected in‐tournament of order ${{n}}\geq {{2}}{{m}}-{{2}}$ such that each arc belongs to a directed path of order at