✦ LIBER ✦

Strongly Hamiltonian-connected locally semicomplete digraphs

✍ Scribed by Guo, Yubao

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 513 KB
Volume: 22
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199605)22:1<65::aid-jgt9>3.0.co;2-j

No coin nor oath required. For personal study only.

✦ Synopsis

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 extend those of Thomassen [I21 for tournaments. 0

📜 SIMILAR VOLUMES

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.

Kings in locally semicomplete digraphs

✍ Ruixia Wang; Aimin Yang; Shiying Wang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB

## Abstract A __k__‐king in a digraph __D__ is a vertex which can reach every other vertex by a directed path of length at most __k__. We consider __k__‐kings in locally semicomplete digraphs and mainly prove that all strong locally semicomplete digraphs which are not round decomposable contain a 2

Locally semicomplete digraphs that are c

Locally semicomplete digraphs that are complementarym-pancyclic

✍ Guo, Yubao; Volkmann, Lutz 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 923 KB

If A and Bare two subdigraphs of D, then we denote by &(A, 5) the distance between A and 5. Let D be a 2-connected locally semicomplete digraph on n 2 6 vertices. If S is a minimum separating set of D and d = min{do-s(N+(s) -S, N-(s) -S ) l s E S}, then rn = max(3, d + 2) I n/2 and D contains t w o

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

Steiner type problems for digraphs that

Steiner type problems for digraphs that are locally semicomplete or extended semicomplete

✍ Jørgen Bang-Jensen; Gregory Gutin; Anders Yeo 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB

## Abstract We consider the following three problems: (P1) Let __D__ be a strong digraph and let __X__ be a non‐empty subset of its vertices. Find a strong subdigraph __D__′ of __D__ which contains all vertices of __X__ and has as few arcs as possible. This problem is also known under the name the

The strongly connected reliability of co

The strongly connected reliability of complete digraphs

✍ J.I. Brown; Xiaohu Li 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB