๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Critically $n$-connected graphs

โœ Scribed by Chartrand, Gary; Kaugars, Agnis; Lick, Don R.

Book ID
118174597
Publisher
American Mathematical Society
Year
1972
Tongue
English
Weight
498 KB
Volume
32
Category
Article
ISSN
0002-9939

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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.

On k-con-Critically n-Connected Graphs
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

Critically (k, k)-connected graphs
Critically (k, k)-connected graphs
โœ Kiyoshi Ando; Yoko Usami ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 359 KB