✦ LIBER ✦

Contractions of 6-connected toroidal graphs

✍ Scribed by Gašper Fijavž

Book ID: 108167420
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 718 KB
Volume: 97
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2006.09.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimally contraction-critically 6-conne

Minimally contraction-critically 6-connected graphs

✍ Kiyoshi Ando; Shinya Fujita; Ken-ichi Kawarabayashi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 274 KB

Five-Connected Toroidal Graphs Are Hamil

Five-Connected Toroidal Graphs Are Hamiltonian

✍ Robin Thomas; Xingxing Yu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 518 KB

We prove that every edge in a 5-connected graph embedded in the torus is contained in a Hamilton cycle. Our proof is constructive and implies a polynomial time algorithm for finding a Hamilton cycle. ## 1997 Academic Press On the other hand, for 4-connected graphs embedded in the torus, certain ed

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

4-Colorable 6-regular toroidal graphs

✍ Hong-Gwa Yeh; Xuding Zhu 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 259 KB

This paper proves two conjectures of Collins, Fisher and Hutchinson about the chromatic number of some circulant graphs. As a consequence, we characterize 4-colorable 6-regular toroidal graphs.

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

The closed 2-cell embeddings of 2-connec

The closed 2-cell embeddings of 2-connected doubly toroidal graphs

✍ Xiaoya Zha 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 711 KB

A closed 2-cell embedding of a graph embedded in some surface is an embedding such that each face is bounded by a circuit in the graph. The closed 2-cell embedding conjecture says that every 2-connected graph has a closed 2-cell embedding in some surface. In this paper, we prove that any 2-connected