𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Directed Path-width and Monotonicity in Digraph Searching

✍ Scribed by János Barát

Publisher
Springer Japan
Year
2006
Tongue
English
Weight
151 KB
Volume
22
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On cycles and paths in digraphs
On cycles and paths in digraphs
✍ M.C. Heydemann 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 273 KB

The purpose of this communication is to announce some slrfficient conditions on degrees and number of arcs to insure the existence of cycles and paths in directed graphs. We show that these results are the best possible. The proofs of the theorems can be found in [4].

Paths and cycles in extended and decompo
Paths and cycles in extended and decomposable digraphs
✍ Jørgen Bang-Jensen; Gregory Gutin 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 835 KB

We consider digraphs --called extended locally semicomplete digraphs, or extended LSD's, for short --that can be obtained from locally semicomplete digraphs by substituting independent sets for vertices. We characterize Hamiltonian extended LSD's as well as extended LSD's containing Hamiltonian path