𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On legal path problems in digraphs

✍ Scribed by Heung-Soon Ihm; Simeon C. Ntafos

Book ID
113162661
Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
551 KB
Volume
18
Category
Article
ISSN
0020-0190

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].

Longest paths in digraphs
Longest paths in digraphs
✍ J. C. Bermond; A. Germa; M. C. Heydemann; D. Sotteau πŸ“‚ Article πŸ“… 1981 πŸ› Springer-Verlag 🌐 English βš– 226 KB
Packing paths in digraphs
Packing paths in digraphs
✍ Richard C. Brewster; Pavol Hell; Sarah H. Pantel; Romeo Rizzi; Anders Yeo πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 132 KB

## Abstract Let ${\cal G}$ be a fixed set of digraphs. Given a digraph __H__, a ${\cal G}$‐packing in __H__ is a collection ${\cal P}$ of vertex disjoint subgraphs of __H__, each isomorphic to a member of ${\cal G}$. A ${\cal G}$‐packing ${\cal P}$ is __maximum__ if the number of vertices belonging