✦ LIBER ✦

Critically (k, k)-connected graphs

✍ Scribed by Kiyoshi Ando; Yoko Usami

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 359 KB
Volume: 66
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(87)90114-2

No coin nor oath required. For personal study only.

📜 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

On k-critical, n-connected graphs

✍ Stephen Maurer; Peter J. Slater 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 718 KB

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). Thi

k-shredders in k-connected graphs

✍ Yoshimi Egawa 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 1 views

## Abstract For a graph __G__, a subset __S__ of __V__(__G__) is called a shredder if __G__ − __S__ consists of three or more components. We show that if __k__ ≥ 4 and __G__ is a __k__‐connected graph, then the number of shredders of cardinality __k__ of __G__ is less than 2|__V__(__G__)|/3 (we sho

Minimally (k, k)-edge-connected graphs

✍ Kamal Hennayake; Hong-Jian Lai; Deying Li; Jingzhong Mao 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB 👁 1 views

## Abstract For an integer __l__ > 1, the __l__‐edge‐connectivity of a connected graph with at least __l__ vertices is the smallest number of edges whose removal results in a graph with __l__ components. A connected graph __G__ is (__k__, __l__)‐edge‐connected if the __l__‐edge‐connectivity of __G_

The k-Critical 2k-Connected Graphs for k

The k-Critical 2k-Connected Graphs for k∈{3, 4}

✍ Matthias Kriesell 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 180 KB

A noncomplete graph G is called an (n, k)-graph if it is n-connected and G&X is not (n&|X | +1)-connected for any X V(G) with |X | k. Mader conjectured that for k 3 the graph K 2k+2 -(1-factor) is the unique (2k, k)-graph. We settle this conjecture for k 4.