✦ LIBER ✦

Longest paths in bipartite digraphs

✍ Scribed by Jacqueline Ayel

Book ID: 107748414
Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 383 KB
Volume: 40
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90192-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Longest paths in digraphs

✍ J. C. Bermond; A. Germa; M. C. Heydemann; D. Sotteau 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 226 KB

Path number of bipartite digraphs

✍ William G Frye; Renu Laskar 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 112 KB

Longest paths and cycles in bipartite or

Longest paths and cycles in bipartite oriented graphs

✍ Zhang Ke Min 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 430 KB 👁 1 views

In this paper we obtain two sufficient conditions, Ore type (Theorem 1) and Dirac type (Theorem 2). on the degrees of a bipartite oriented graph for ensuring the existence of long paths and cycles. These conditions are shown to be the best possible in a sense. An oriented graph is a digraph without

Cycles and paths of many lengths in bipa

Cycles and paths of many lengths in bipartite digraphs

✍ Denise Amar; Yannis Manoussakis 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 580 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