𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Superfluous paths in strong digraphs

✍ Scribed by Claudio L. Lucchesi; Jeffrey A. Ross

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
611 KB
Volume
47
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Infinite Hamiltonian paths in Cayley dig
Infinite Hamiltonian paths in Cayley digraphs
✍ Irwin L Jungreis πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 942 KB

Let Cay(S : H) be the Cayley digraph of the generators S in the group H. A one-way infinite Hamiltonian path in the digraph G is a listing of all the vertices [q: 1 ~< i <oo], such that there is an arc from vi to vi+ 1. A two-way infinite Hamiltonian path is similarly defined, with i ranging from -0

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