𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Weakly Hamiltonian-connected locally semicomplete digraphs

✍ Scribed by Bang-Jensen, J�rgen; Guo, Yubao; Volkmann, Lutz

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
630 KB
Volume
21
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

We characterize weakly hamiltonian-connected locally semicomplete digraphs.

📜 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

Kings in 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

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

Hamiltonian N2-locally connected claw-fr
Hamiltonian N2-locally connected claw-free graphs
✍ Hong-Jian Lai; Yehong Shao; Mingquan Zhan 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 63 KB 👁 1 views

A graph G is N 2 -locally connected if for every vertex v in G, the edges not incident with v but having at least one end adjacent to v in G induce a connected graph. In 1990, Ryja ´c ˇek conjectured that every 3-connected N 2 -locally connected claw-free graph is Hamiltonian. This conjecture is pro