✦ LIBER ✦

Minimally contraction-critically 6-connected graphs

✍ Scribed by Kiyoshi Ando; Shinya Fujita; Ken-ichi Kawarabayashi

Book ID: 113567351
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 274 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.06.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Critically $n$-connected graphs

✍ Chartrand, Gary; Kaugars, Agnis; Lick, Don R. 📂 Article 📅 1972 🏛 American Mathematical Society 🌐 English ⚖ 498 KB

Minimally 3-connected graphs

✍ Robin W Dawes 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 489 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

Critically (k, k)-connected graphs

✍ Kiyoshi Ando; Yoko Usami 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 359 KB

Contractions of 6-connected toroidal gra

Contractions of 6-connected toroidal graphs

✍ Gašper Fijavž 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 718 KB