✦ LIBER ✦

Onk- critical 2k- connected graphs

✍ Scribed by Jianji Su; Xudong Yuan; Qiaofeng Zhao

Book ID: 111784689
Publisher: SP Science China Press
Year: 2003
Tongue: English
Weight: 224 KB
Volume: 46
Category: Article
ISSN: 1674-7283
DOI: 10.1360/03ys9031

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Onk-Critical Connected Line Graphs

✍ Matthias Kriesell 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 181 KB

We show that any line graph contains a set of three vertices which is not included in a smallest separating vertex set. This was conjectured by Maurer and Slater. ## 1998 Academic Press Let }(G) denote the vertex connectivity of a graph G. A set of }(G) vertices which separates G will be called a

Onk-diameter ofk-connected graphs

✍ Xu Junming; Xu Keli 📂 Article 📅 2001 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 310 KB

A Note onk-Connected Rayless Graphs

✍ Rudolf Halin 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 160 KB

In this note a short new proof of Diestel's characterization theorem for infinite k-connected rayless graphs is given, using the concept of the order of a rayless graph which was introduced by R. Schmidt. 1998 Academic Press Diestel [3, Theorem 4.3] gives a beautiful description of the structure of

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.

Critically (k, k)-connected graphs

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

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