✦ LIBER ✦

Cycles in dense digraphs

✍ Scribed by Maria Chudnovsky; Paul Seymour; Blair Sullivan

Book ID: 106167694
Publisher: Springer-Verlag
Year: 2008
Tongue: English
Weight: 347 KB
Volume: 28
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-008-2331-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Dense bipartite digraphs

✍ M. A. Fiol; J. L. A. Yebra 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 523 KB

## Abstract For its implications in the design of interconnection networks, it is interesting to find (a) (di)graphs with given maximum (out‐)degree __d__ and diameter __D__ that have large order; (b) (di)graphs of given order and maximum (out‐)degree __d__ that have small diameter. (Di)graphs o

Oriented hamilton cycles in digraphs

✍ Roland Häggkvist; Andrew Thomason 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 473 KB

## Abstract We show that a directed graph of order __n__ will contain __n__‐cycles of every orientation, provided each vertex has indegree and outdegree at least (1/2 + __n__^‐1/6^)__n__ and __n__ is sufficiently large. © 1995 John Wiley & Sons, Inc.

Almost Symmetric Cycles in Large Digraph

Almost Symmetric Cycles in Large Digraphs

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

Consistent Cycles in Graphs and Digraphs

✍ Štefko Miklavič; Primož Potočnik; Steve Wilson 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 121 KB