✦ LIBER ✦

On k-critical, n-connected graphs

✍ Scribed by Stephen Maurer; Peter J. Slater

Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 718 KB
Volume: 20
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(77)90065-6

No coin nor oath required. For personal study only.

✦ Synopsis

A graph G which iit n-connected (but not (I! I)-connected) is defined ro be k-xitical if for every S 6; V(G), where f S i d k. the connectivity of G -I S is h -/S ia We will say that G is an (n*,k*) graph if G is n-conneckxt (b:lt nat (n t Itconnected) and k-crirical (hut not (k c l)criticaf). This initurl study of k-critical graphs is concerned with the problem of determining the values of R and k for which there rxrsts an (n *, k ') graph. * $%is work ~8% supported by the U.S. Fhqy Resezwh and Dcurtopment Adminirrtration (ERDA) w&r -tract Na. A'&&-1)-7N9.

📜 SIMILAR VOLUMES

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

Proof of Mader's conjecture on k-critica

Proof of Mader's conjecture on k-critical n-connected graphs

✍ Su Jianji 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 1 views

## Abstract Mader conjectured that every __k__‐critical __n__‐connected noncomplete graph __G__ has __2k__ + 2 pairwise disjoint fragments. The author in 9 proved that the conjecture holds if the order of __G__ is greater than (__k__ + 2)__n__. Now we settle this conjecture completely. © 2004 Wiley

Critically (k, k)-connected graphs

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

On n-connected graphs

✍ Branko Grünbaum 📂 Article 📅 1969 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB

The main aim of the present note is the proof of a variant of the MENGER-WHITNEY theorem on n-connected graphs (Theorem 1 below). While the result itself is well known (being, for example, a special case of the theorem of MENGER mentioned in Remark I), two of its aspects deserve attention. First, it

Maximam critical n-edge connected graph

📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB