✦ LIBER ✦

Note on Halin's theorem on minimally connected graphs

✍ Scribed by T Kameda

Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 205 KB
Volume: 17
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(74)90039-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Minimally (n, λ)-Connected Graphs

✍ Atsushi Kaneko; Katsuhiro Ota 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 128 KB

A graph G is (n, \*)-connected if it satisfies the following conditions: (1) |V(G)| n+1; (2) for any subset S V(G) and any subset L E(G) with \* |S| +|L| <n\*, G&S&L is connected. The (n, \*)-connectivity is a common extension of both the vertex-connectivity and the edge-connectivity. An (n, 1)-conn

On minimal neighbourhood-connected graph

On minimal neighbourhood-connected graphs

✍ Bert L. Hartnell; William Kocay 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 809 KB

Hartnell, B.L. and W. Kocay, On minimal neighbourhood-connected graphs, Discrete Mathematics 92 (1991) 95-105. The closed neighbourhood of a vertex u of a graph G is u\* = {v 1 v is adjacent to u} U {u}. G is neighbourhood-connected if it is connected, and G -u' is connected but not complete, for al

A local structure theorem on 5-connected

A local structure theorem on 5-connected graphs

✍ Kiyoshi Ando 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 281 KB

## Abstract An edge of a 5‐connected graph is said to be contractible if the contraction of the edge results in a 5‐connected graph. Let __x__ be a vertex of a 5‐connected graph. We prove that if there are no contractible edges whose distance from __x__ is two or less, then either there are two tri

A note on minimal visibility graphs

✍ Xiaojun Shen; Qing Hu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 60 KB

A note on dominating cycles in 2-connect

A note on dominating cycles in 2-connected graphs

✍ D. Bauer; E. Schmeichel; H.J. Veldman 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 277 KB

On Petersen's graph theorem

✍ Nathan Linial 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 399 KB

In thiq paper we prove the following: let G be a graph with k edges, wihich js (k -l)-edgeconnectd, and with all valences 3k k. Let 1 c r~ k be an integer, then (3 -tins a spanning subgraph H, so that all valences in H are ar, with no more than r~/r:] edges. The proof is based on a useful extension