✦ LIBER ✦

Onk-diameter ofk-connected graphs

✍ Scribed by Xu Junming; Xu Keli

Book ID: 107500500
Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 2001
Tongue: English
Weight: 310 KB
Volume: 16
Category: Article
ISSN: 1005-1031
DOI: 10.1007/s11766-001-0059-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Onk- critical 2k- connected graphs

✍ Jianji Su; Xudong Yuan; Qiaofeng Zhao 📂 Article 📅 2003 🏛 SP Science China Press 🌐 English ⚖ 224 KB

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

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

Onk-ordered Hamiltonian graphs

✍ Kierstead, H. A.; S�rk�zy, G. N.; Selkow, S. M. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB 👁 1 views

the smallest integer m for which any graph on n vertices with minimum degree at least m is a k-ordered Hamiltonian graph. In this article, answering a question of Ng and Schultz, we determine

Connectivity and diameter in distance gr

Connectivity and diameter in distance graphs

✍ Lucia Draque Penso; Dieter Rautenbach; Jayme Luiz Szwarcfiter 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

On the fault-tolerant diameter and wide

On the fault-tolerant diameter and wide diameter of ω-connected graphs

✍ Jian-Hua Yin; Jiong-Sheng Li; Guo-Liang Chen; Cheng Zhong 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB