✦ LIBER ✦

Almost Given Length Cycles in Digraphs

✍ Scribed by Raphael Yuster

Book ID: 106047712
Publisher: Springer Japan
Year: 2008
Tongue: English
Weight: 92 KB
Volume: 24
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-007-0769-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Almost Symmetric Cycles in Large Digraph

Almost Symmetric Cycles in Large Digraphs

✍ Lech Adamus; A. Paweł Wojda 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 144 KB

Cycles of given length in oriented graph

Cycles of given length in oriented graphs

✍ Luke Kelly; Daniela Kühn; Deryk Osthus 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 248 KB

Cycles in dense digraphs

✍ Maria Chudnovsky; Paul Seymour; Blair Sullivan 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 347 KB

Destroying cycles in digraphs

✍ Molly Dunkum; Peter Hamburger; Attila Pór 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 194 KB

Short cycles in digraphs

✍ Tsuyoshi Nishimura 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 188 KB

Caccetta and Haggkvist [l] conjectured that every digraph with n vertices and minimum outdegree k contains a directed cycle of length at most [n/k]. With regard to this conjecture, Chvatal and Szemeredi [2] proved that if G is a digraph with n vertices and if each of these vertices has outdegree at

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