✦ LIBER ✦

2-connected and 2-edge-connected Steinhaus graphs

✍ Scribed by Dongju Kim; Daekeun Lim

Book ID: 108315742
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 131 KB
Volume: 256
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00468-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimally 2-edge connected graphs

✍ G. Chaty; M. Chein 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 338 KB

## Abstract A constructive characterization of minimally 2‐edge connected graphs, similar to those of Dirac for minimally 2‐connected graphs is given.

Pruning 2-Connected Graphs

✍ Chandra Chekuri; Nitish Korula 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 857 KB

2-connected graphs with small 2-connecte

2-connected graphs with small 2-connected dominating sets

✍ Yair Caro; Raphael Yuster 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 101 KB

Convex partitions with 2-edge connected

Convex partitions with 2-edge connected dual graphs

✍ Marwan Al-Jubeh; Michael Hoffmann; Mashhood Ishaque; Diane L. Souvaine; Csaba D. 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 720 KB

Edge-hamiltonian property in regular 2-

Edge-hamiltonian property in regular 2- connected graphs

✍ Hao Li 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 515 KB

Bill Jackson has proved that every 2-connected, k-regular graph on at most 3k vertices is hamiltonian. It is shown in this paper that, under almost the same conditions as above, the graphs are edge-hamiltonian.

Connected, locally 2-connected, K1,3-fre

Connected, locally 2-connected, K1,3-free graphs are panconnected

✍ S. V. Kanetkar; P. R. Rao 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 1 views

## Abstract A graph __G__ is locally __n__‐connected, __n__ ≥ 1, if the subgraph induced by the neighborhood of each vertex is __n__‐connected. We prove that every connected, locally 2‐connected graph containing no induced subgraph isomorphic to __K__~1,3~ is panconnected.