✦ LIBER ✦

On critically h-connected simple graphs

✍ Scribed by Yaha Ould Hamidoune

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 227 KB
Volume: 32
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(80)90263-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On multiply critically h-connected graph

On multiply critically h-connected graphs

✍ Yahya Ould Hamidoune 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 262 KB

On k-con-Critically n-Connected Graphs

✍ W. Mader 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 221 KB

We prove that every n-connected graph G of sufficiently large order contains a connected graph H on four vertices such that G À V ðH Þ is ðn À 3Þ-connected. This had been conjectured in Mader (High connectivity keeping sets in n-connected graphs, Combinatorica, to appear). Furthermore, we prove uppe

On locally k-critically n-connected grap

On locally k-critically n-connected graphs

✍ Jianji Su 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 479 KB

Su, J., On locally k-critically n-connected graphs, Discrete Mathematics 120 (1993) 183-190. Let 0 # W'g V(G). The graph G is called a W-locally k-critically n-connected graph or simply a W-locally (n, k)-graph, if for all V'G W with 1 V'I 6 k and each fragment F of G we have that K(G-V')=n-1 V' and

Critically (k, k)-connected graphs

✍ Kiyoshi Ando; Yoko Usami 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 359 KB

Characterization of maximum critically 2

Characterization of maximum critically 2-connected graphs

✍ R. C. Entringer 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB

## Abstract A graph __G__ is critically 2‐connected if __G__ is 2‐connected but, for any point __p__ of __G, G — p__ is not 2‐connected. Critically 2‐connected graphs on __n__ points that have the maximum number of lines are characterized and shown to be unique for __n__ ⩾ 3, __n__ ≠ 11.

Fragments in 2-Critically n-Connected Gr

Fragments in 2-Critically n-Connected Graphs

✍ J.J. Su 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 428 KB

Mader conjectured that every non-complete \(k\)-critically \(n\)-connected graph has \((2 k+2)\) pairwise disjoint fragments. The conjecture was verified by Mader for \(k=1\). In this paper, we prove that this conjecture holds also for \(k=2\). 1993 Academic Press. Inc.