𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Vertex-Disjoint Cycles Containing Specified Edges

✍ Scribed by Yoshimi Egawa; Ralph J. Faudree; Ervin Györi; Yoshiyasu Ishigami; Richard H. Schelp; Hong Wang

Book ID
106047985
Publisher
Springer Japan
Year
2000
Tongue
English
Weight
157 KB
Volume
16
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex-disjoint cycles containing specif
Vertex-disjoint cycles containing specified vertices in a bipartite graph
✍ Guantao Chen; Hikoe Enomoto; Ken-ichi Kawarabayashi; Katsuhiro Ota; Dingjun Lou; 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB

## Abstract A minimum degree condition is given for a bipartite graph to contain a 2‐factor each component of which contains a previously specified vertex. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 145–166, 2004

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

Edge disjoint cycles through specified v
Edge disjoint cycles through specified vertices
✍ Luis Goddyn; Ladislav Stacho 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB

## Abstract We give a sufficient condition for a simple graph __G__ to have __k__ pairwise edge‐disjoint cycles, each of which contains a prescribed set __W__ of vertices. The condition is that the induced subgraph __G__[__W__] be 2__k__‐connected, and that for any two vertices at distance two in _

Vertex-disjoint cycles of length at most
Vertex-disjoint cycles of length at most four each of which contains a specified vertex
✍ Yoshiyas Ishigami 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB

## Abstract We obtain a sharp minimum degree condition δ (G) ≥ $\lfloor {\sqrt {\phantom{n^2}n+k^2-3k+1}}\rfloor + 2k-1$ of a graph __G__ of order __n__ ≥ 3__k__ guaranteeing that, for any __k__ distinct vertices, __G__ contains __k__ vertex‐disjoint cycles of length at most four each of which cont