✦ LIBER ✦

Cycles through specified vertices of a graph

✍ Scribed by J. A. Bondy; L. Lovász

Book ID: 110564316
Publisher: Springer-Verlag
Year: 1981
Tongue: English
Weight: 869 KB
Volume: 1
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02579268

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counterexamples to a conjecture of mader

Counterexamples to a conjecture of mader about cycles through specified vertices inn-edge-connected graphs

✍ Andreas Huck; Haruko Okamura 📂 Article 📅 1992 🏛 Springer Japan 🌐 English ⚖ 235 KB

Long cycles through specified vertices i

Long cycles through specified vertices in a graph

✍ Akira Saito 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 650 KB

Cycles through specified vertices

✍ Béla Bollobás; Graham Brightwell 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 552 KB

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 _

A 2-factor with Short Cycles Passing Thr

A 2-factor with Short Cycles Passing Through Specified Independent Vertices in Graph

✍ Jiuying Dong 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 136 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