✦ LIBER ✦

A degree condition for cycles of maximum length in bipartite digraphs

✍ Scribed by Janusz Adamus; Lech Adamus

Book ID: 113567530
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 240 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.11.032

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Semiexact Degree Condition for Hamilto

A Semiexact Degree Condition for Hamilton Cycles in Digraphs

✍ Christofides, Demetres; Keevash, Peter; Kühn, Daniela; Osthus, Deryk 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 621 KB

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

Orientations of Hamiltonian cycles in bi

Orientations of Hamiltonian cycles in bipartite digraphs

✍ A. P. Wojda; M. Woźniak 📂 Article 📅 1994 🏛 Springer Netherlands 🌐 English ⚖ 309 KB

A Chvátal-Erdös condition for hamilton c

A Chvátal-Erdös condition for hamilton cycles in digraphs

✍ Bill Jackson 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 336 KB

A sufficient condition for Hamiltonian c

A sufficient condition for Hamiltonian cycles in bipartite tournaments

✍ Jing Tang; Jianzhong Wang; Wanpeng Lei 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 75 KB

Vertex Disjoint Cycles of Different Leng

Vertex Disjoint Cycles of Different Length in Digraphs

✍ Henning, Michael A.; Yeo, Anders 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 175 KB