✦ LIBER ✦

Contractible Triples in Highly Connected Graphs

✍ Scribed by Shinya Fujita; Ken-ichi Kawarabayashi

Book ID: 105764864
Publisher: Springer
Year: 2010
Tongue: English
Weight: 231 KB
Volume: 14
Category: Article
ISSN: 0218-0006
DOI: 10.1007/s00026-011-0070-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Contractible Cliques ink-Connected Graph

Contractible Cliques ink-Connected Graphs

✍ Xiaolong Huang; Zemin Jin; Xingxing Yu; Xiaoyan Zhang 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 140 KB

Contractible edges in 3-connected graphs

✍ Kiyoshi Ando; Hikoe Enomoto; Akira Saito 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 371 KB

Contractible Edges in 7-Connected Graphs

✍ Su Jian ji; Yuan Xudong 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 164 KB

Contractible circuits in 3-connected gra

Contractible circuits in 3-connected graphs

✍ D.W. Barnette 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 603 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

Contractible Subgraphs in 3-Connected Gr

Contractible Subgraphs in 3-Connected Graphs

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

A subgraph H of a 3-connected finite graph G is called contractible if H is connected and G&V(H) is 2-connected. This work is concerned with a conjecture of McCuaig and Ota which states that for any given k there exists an f (k) such that any 3-connected graph on at least f (k) vertices possesses a