✦ LIBER ✦

Degree-regular triangulations of torus and Klein bottle

✍ Scribed by Basudeb Datta; Ashish Kumar Upadhyay

Publisher: Indian Academy of Sciences
Year: 2005
Tongue: English
Weight: 296 KB
Volume: 115
Category: Article
ISSN: 0253-4142
DOI: 10.1007/bf02829658

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Irreducible Triangulations of the Klein

Irreducible Triangulations of the Klein Bottle

✍ Serge Lawrencenko; Seiya Negami 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 399 KB

We determine the complete list of the irreducible triangulations of the Klein bottle, up to equivalence, analyzing their structures. 1997 Academic Press ## 1. Introduction A triangulation of a closed surface is a simple graph embedded on the surface so that each face is triangular and that any tw

Constructing the Graphs That Triangulate

Constructing the Graphs That Triangulate Both the Torus and the Klein Bottle

✍ Serge Lawrencenko; Seiya Negami 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 158 KB

We show how to construct all the graphs that can be embedded on both the torus and the Klein bottle as their triangulations.

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

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

Coloring even-faced graphs in the torus

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

✍ Daniel Král’; Robin Thomas 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 485 KB

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