✦ LIBER ✦

Path-connectivity in graphs

✍ Scribed by Michael Hager

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 420 KB
Volume: 59
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(86)90068-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Connectivity keeping paths in k-connecte

Connectivity keeping paths in k-connected graphs

✍ W. Mader 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB 👁 1 views

## Abstract A result of G. Chartrand, A. Kaugars, and D. R. Lick [Proc Amer Math Soc 32 (1972), 63–68] says that every finite, k‐connected graph __G__ of minimum degree at least ⌊3__k__/2⌋ contains a vertex __x__ such that __G__−__x__ is still __k__‐connected. We generalize this result by proving t

Long path connectivity of regular graphs

✍ Cun-Quan Zhang; Yong-Jin Zhu 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 842 KB

Zhang, C.-Q. and Y.-J. Zhu, Long path connectivity of regular graphs, Discrete Mathematics 96 (1991) 151-160. Any pair of vertices in a 4-connected path or a path of length at least 3k-6. non-bipartite k-regular graph are joined bY a Hamilton \* This research was partially supported by AFOSR under g

Induced paths in 5-connected graphs

✍ Matthias Kriesell 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 75 KB 👁 2 views

We show that between any two vertices of a 5-connected graph there exists an induced path whose vertices can be removed such that the remaining graph is 2-connected.

Hamiltonian paths and hamiltonian connec

Hamiltonian paths and hamiltonian connectivity in graphs

✍ Bing Wei 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 388 KB

## Let G be a 2-connected graph with n vertices such that d(u)+d(u)+d(w)-IN(u)nN(u)nN(w)I an+ 1 holds for any triple of independent vertices u, v and w. Then for any distinct vertices u and u such that {u, 0) is not a cut vertex set of G, there is a hamiltonian path between u and o. In particular,

Locating median paths on connected outer

Locating median paths on connected outerplanar graphs

✍ Isabella Lari; Federica Ricca; Andrea Scozzari; Ronald I. Becker 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 215 KB 👁 1 views

Long paths through four vertices in a 2-

Long paths through four vertices in a 2-connected graph

✍ Barovich, Mark V. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB 👁 2 views

Let G be a 2-connected graph, let u and v be distinct vertices in V (G), and let X be a set of at most four vertices lying on a common (u