✦ LIBER ✦

Contractible edges in a k-connected graph (K1 + P4)-free graph

✍ Scribed by Kiyoshi Ando

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 215 KB
Volume: 5
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80111-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Non-contractible edges in a 3-connected

Non-contractible edges in a 3-connected graph

✍ Yoshimi Egawa; Katsuhiro Ota; Akira Saito; Xingxing Yu 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 412 KB

Contractible edges in minimally k-connec

Contractible edges in minimally k-connected graphs

✍ Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 420 KB

Contractible Edges and Triangles in k-Co

Contractible Edges and Triangles in k-Connected Graphs

✍ Ken-ichi Kawarabayashi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 129 KB

It is proved that if G is a k-connected graph which does not contain K - 4 , then G has an edge e or a triangle T such that the graph obtained from G by connecting e or by contracting T is still k-connected. By using this theorem, we prove some theorems which are generalizations of earlier work. In

Distribution of contractible edges in k-

Distribution of contractible edges in k-connected graphs

✍ Nathaniel Dean 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 370 KB

Contractible subgraphs in k-connected gr

Contractible subgraphs in k-connected graphs

✍ Zemin Jin; Xingxing Yu; Xiaoyan Zhang 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB

## Abstract For a graph __G__ we define a graph __T__(__G__) whose vertices are the triangles in __G__ and two vertices of __T__(__G__) are adjacent if their corresponding triangles in __G__ share an edge. Kawarabayashi showed that if __G__ is a __k__‐connected graph and __T__(__G__) contains no ed

Paths in k-edge-connected graphs

✍ Haruko Okamura 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 562 KB