✦ LIBER ✦

Cycles through specified vertices

✍ Scribed by Béla Bollobás; Graham Brightwell

Book ID: 105150225
Publisher: Springer-Verlag
Year: 1993
Tongue: English
Weight: 552 KB
Volume: 13
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01303200

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 _

Cycles through specified vertices of a g

Cycles through specified vertices of a graph

✍ J. A. Bondy; L. Lovász 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 869 KB

Long cycles through specified vertices i

Long cycles through specified vertices in a graph

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

Trees through specified vertices

✍ J. Cutler 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 530 KB

Cycles and paths through specified verti

Cycles and paths through specified vertices in k-connected graphs

✍ Y Egawa; R Glas; S.C Locke 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 693 KB

Heavy cycles passing through some specif

Heavy cycles passing through some specified vertices in weighted graphs

✍ Jun Fujisawa; Kiyoshi Yoshimoto; Shenggui Zhang 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

## Abstract A weighted graph is one in which every edge __e__ is assigned a nonnegative number, called the weight of __e__. The sum of the weights of the edges incident with a vertex υ is called the weighted degree of υ. The weight of a cycle is defined as the sum of the weights of its edges. In th