✦ LIBER ✦

Graph Connectivity After Path Removal

✍ Scribed by Guantao Chen*; RonaldJ. Gould†; Xingxing Yu‡

Publisher: Springer-Verlag
Year: 2003
Tongue: English
Weight: 276 KB
Volume: 23
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s003-0018-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Path connected graphs

✍ R. J. Faudree; R. H. Schelp 📂 Article 📅 1974 🏛 Akadmiai Kiad 🌐 English ⚖ 467 KB

Path-connectivity in graphs

✍ Michael Hager 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 420 KB

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

Algorithms for path searching and for gr

Algorithms for path searching and for graph connectivity analysis

✍ A. Recuero 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 980 KB

Three algorithms for the search of oriented paths in digraphs are described, based in the generation of a tree, in which an BFS is done, in the first one, and a DFS is done, in the other two algorithms. The first one is aimed at finding all the optimum paths between two vertices. The second one is a

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.

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