𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complementary cycles containing prescribed vertices in tournaments

✍ Scribed by Jørgen Bang-Jensen; Yubao Guo; Anders Yeo

Book ID
108316394
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
196 KB
Volume
214
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Complementary cycles containing a fixed
Complementary cycles containing a fixed arc in diregular bipartite tournaments
✍ Ke Min Zhang; Yannis Manoussakis; Zeng Min Song 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 250 KB

Let (x, y) be a specified arc in a k-regular bipartite tournament B. We prove that there exists a cycle C of length four through (x, y) in B such that B-C is hamiltonian.

On cycles through prescribed vertices in
On cycles through prescribed vertices in weakly separable graphs
✍ A.K. Kelmans; M.V. Lomonosov 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 275 KB

Notions and notations 1.1. Given an undirected graph G let V(G), E(G), K(G) and comp(G) denote the vertex-set, edge-set, vertex connectivity and number of components of G, respectively. Put P(G)={(X, Y): X~V(G), Tc\\_E(G--X)}. For X~V(G) let G(X) denote the induced suL\\*graph. For Y :\\_ E(G) let G