✦ LIBER ✦

On the Existence of Disjoint Cycles in a Graph

✍ Scribed by Hikoe Enomoto

Publisher: Springer-Verlag
Year: 1998
Tongue: English
Weight: 129 KB
Volume: 18
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s004930050034

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Two vertex-disjoint cycles in a graph

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

Large Vertex-Disjoint Cycles in a Bipart

Large Vertex-Disjoint Cycles in a Bipartite Graph

✍ Hong Wang 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 100 KB

Disjoint Hamilton cycles in the random g

Disjoint Hamilton cycles in the random geometric graph

✍ Tobias Müller,; Xavier Pérez-Giménez;; Nicholas Wormald 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 270 KB

We consider the standard random geometric graph process in which n vertices are placed at random on the unit square and edges are sequentially added in increasing order of edge-length. For fixed k ≥ 1, we prove that the first edge in the process that creates a k-connected graph coincides a.a.s. with

Two edge-disjoint hamiltonian cycles in

Two edge-disjoint hamiltonian cycles in the butterfly graph

✍ Dominique Barth; André Raspaud 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 493 KB

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