✦ LIBER ✦

On minimally 3-connected graphs on a surface

✍ Scribed by Katsuhiro Ota

Book ID: 108498076
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 23 KB
Volume: 11
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80006-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimally 3-connected graphs

✍ Robin W Dawes 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 489 KB

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

Note on Halin's theorem on minimally con

Note on Halin's theorem on minimally connected graphs

✍ T Kameda 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 205 KB

On k-minimally n-edge-connected graphs

✍ Stephen B. Maurer; Peter J. Slater 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 815 KB

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

Meshes on 3-connected graphs

✍ Gert Sabidussi 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 866 KB