𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Coloring even-faced graphs in the torus and the Klein bottle

✍ Scribed by Daniel Král’; Robin Thomas

Publisher
Springer-Verlag
Year
2008
Tongue
English
Weight
485 KB
Volume
28
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spanning Planar Subgraphs of Graphs in t
Spanning Planar Subgraphs of Graphs in the Torus and Klein Bottle
✍ R. Brunet; M.N. Ellingham; Z.C. Gao; A. Metzlar; R.B. Richter 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 685 KB

There are two main purposes of this article. First we show that every 3-connected graph embedded in the torus or the Klein bottle has a spanning planar subgraph which is 2-connected, and in fact has a slightly stronger connectivity property. Second, this subgraph is applied to show that every 3-conn

Disjoint Cycles in Directed Graphs on th
Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle
✍ G.L. Ding; A. Schrijver; P.D. Seymour 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 203 KB

We give necessary and sufficient conditions for a directed graph embedded on the torus or the Klein bottle to contain pairwise disjoint circuits, each of a given orientation and homotopy, and in a given order. For the Klein bottle, the theorem is new. For the torus, the theorem was proved before by

Chords of longest circuits of graphs emb
Chords of longest circuits of graphs embedded in torus and Klein bottle
✍ Xuechao Li; Cun-Quan Zhang 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

## Abstract Thomassen conjectured that every longest circuit of a 3‐connected graph has a chord. It is proved in this paper that every longest circuit of a 4‐connected graph embedded in a torus or Klein bottle has a chord. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 1–23, 2003