✦ LIBER ✦

Hadwiger's conjecture (k = 6) : Neighbour configurations of 6-vertices in contraction- critical graphs

✍ Scribed by Jean Mayer

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 938 KB
Volume: 74
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90205-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertices of degree 6 in a 6-contraction

Vertices of degree 6 in a 6-contraction critical graph

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

An edge of a \(k\)-connected graph is said to be \(k\)-contractible if the contraction of the edge results in a \(k\)-connected graph. A \(k\)-connected graph with no \(k\)-contractible edge is said to be a \(k\)-contraction critical graph. We prove that every 6 -contraction critical graph of order

Vertices of degree 6 in a contraction cr

Vertices of degree 6 in a contraction critically 6-connected graph

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

An edge of a 6-connected graph is said to be 6-contractible if the contraction of the edge results in a 6-connected graph. A contraction critically 6-connected graph is a 6-connected graph with no 6-contractible edge. We prove that each contraction critically 6-connected graph G has at least 1 7 |V