✦ LIBER ✦

Vertex-disjoint cycles in regular tournaments

✍ Scribed by Nicolas Lichiardopol

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two vertex-disjoint cycles in a graph

✍ Hong Wang 📂 Article 📅 1995 🏛 Springer Japan 🌐 English ⚖ 499 KB

Vertex-disjoint chorded cycles in a grap

Vertex-disjoint chorded cycles in a graph

✍ Shengning Qiao; Shenggui Zhang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 208 KB

Vertex-Disjoint Cycles Containing Specif

Vertex-Disjoint Cycles Containing Specified Edges

✍ Yoshimi Egawa; Ralph J. Faudree; Ervin Györi; Yoshiyasu Ishigami; Richard H. Sch 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 157 KB

Vertex-disjoint cycles containing prescr

Vertex-disjoint cycles containing prescribed vertices

✍ Yoshiyasu Ishigami; Tao Jiang 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 206 KB

## Abstract Enomoto 7 conjectured that if the minimum degree of a graph __G__ of order __n__ ≥ 4__k__ − 1 is at least the integer $ \left \lfloor \sqrt{n+\left (\,{9 \over 4}k^2 - 4k + 1\right)} \,+ {3 \over 2}k - 1 \right \rfloor$, then for any __k__ vertices, __G__ contains __k__ vertex‐disjoint

Notes on cycles through a vertex or an a

Notes on cycles through a vertex or an arc in regular 3-partite tournaments

✍ Gaokui Xu; Shengjia Li; Qiaoping Guo; Hongwei Li 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Edge-disjoint cycles in regular directed

Edge-disjoint cycles in regular directed graphs

✍ Alon, Noga; McDiarmid, Colin; Molloy, Michael 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 356 KB 👁 3 views

We prove that any k-regular directed graph with no parallel edges contains a collection of at least fl(k2) edge-disjoint cycles; we conjecture that in fact any such graph contains a collection of at least ( lCi1 ) disjoint cycles, and note that this holds for k 5 3. o 1996