✦ LIBER ✦

Longest paths in digraphs

✍ Scribed by J. C. Bermond; A. Germa; M. C. Heydemann; D. Sotteau

Book ID: 110564492
Publisher: Springer-Verlag
Year: 1981
Tongue: English
Weight: 226 KB
Volume: 1
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02579454

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Longest paths in bipartite digraphs

✍ Jacqueline Ayel 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 383 KB

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

Longest cycles in sparse random digraphs

✍ Michael Krivelevich; Eyal Lubetzky; Benny Sudakov 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB

Disjoint Paths in Acyclic Digraphs

✍ A. Metzlar 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 455 KB

Superfluous paths in strong digraphs

✍ Claudio L. Lucchesi; Jeffrey A. Ross 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 611 KB

Enumeration of paths in digraphs

✍ K. R. Parthasarathy 📂 Article 📅 1964 🏛 Springer 🌐 English ⚖ 644 KB