✦ LIBER ✦

Cycles and paths through specified vertices in k-connected graphs

✍ Scribed by Y Egawa; R Glas; S.C Locke

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 693 KB
Volume: 52
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(91)90086-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycles through k+2 vertices in k-connect

Cycles through k+2 vertices in k-connected graphs

✍ N. Tsikopoulos 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 73 KB

Cycles passing through k + 1 vertices in

Cycles passing through k + 1 vertices in k-connected graphs

✍ Jun Fujisawa; Tomoki Yamashita 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

## Abstract In this article, we prove the following theorem. Let __k__ ≥ 3 be an integer, __G__ be a __k__‐connected graph with minimum degree __d__ and __X__ be a set of __k__ + 1 vertices on a cycle. Then __G__ has a cycle of length at least min {2d,|V(G)|} passing through __X__. This result give

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

Relative lengths of paths and cycles in

Relative lengths of paths and cycles in k-connected graphs

✍ S.C Locke 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 583 KB

Circuits through prescribed vertices in

Circuits through prescribed vertices in k-connected k-regular graphs

✍ Roland Häggkvist; Wolfgang Mader 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB 👁 1 views

## Abstract We show that every set of $k+\lfloor{1\over 3}\sqrt{k}\rfloor$ vertices in a __k__‐connected __k__‐regular graph belongs to some circuit. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 145–163, 2002

Long cycles passing through a specified

Long cycles passing through a specified path in a graph

✍ Hirohata, Kazuhide 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB 👁 2 views

## For a graph G and an integer an independent set of vertices in G}. Enomoto proved the following theorem. Let s ≥ 1 and let G be a (s + 2)-connected graph. Then G has a cycle of length ≥ min{|V (G)|, σ 2 (G) -s} passing through any path of length s. We generalize this result as follows. Let k ≥