✦ LIBER ✦

Diagonal Transformations of Graphs and Dehn Twists of Surfaces

✍ Scribed by Atsuhiro Nakamoto; Katsuhiro Ota

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 231 KB
Volume: 70
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1997.1759

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Diagonal transformations in quadrangulat

Diagonal transformations in quadrangulations of surfaces

✍ Nakamoto, Atsuhiro 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 546 KB

In this paper, it will be shown that any two bipartite quadrangulations of any closed surface are transformed into each other by two kinds of transformations, called the diagonal slide and the diagonal rotation, up to homeomorphism, if they have the same and sufficiently large number of vertices.

Diagonal Transformations and Cycle Parit

Diagonal Transformations and Cycle Parities of Quadrangulations on Surfaces

✍ Atsuhiro Nakamoto 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 255 KB

In this paper, we shall show that any two quadrangulations on any closed surface can be transformed into each other by diagonal slides and diagonal rotations if they have the same and sufficiently large number of vertices and if the homological properties of both quadrangulations coincide.

2- and 3-factors of graphs on surfaces

✍ Ken-Ichi Kawarabayashi; Kenta Ozeki 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB 👁 1 views

It has been conjectured that any 5-connected graph embedded in a surface with sufficiently large face-width is hamiltonian. This conjecture was verified by Yu for the triangulation case, but it is still open in general. The conjecture is not true for 4-connected graphs. In this article, we shall stu

Twist–Rotation Transformations of Binary

Twist–Rotation Transformations of Binary Trees and Arithmetic Expressions

✍ Ming Li; Louxin Zhang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 101 KB

The paper studies the computational complexity and efficient algorithms for the twist᎐rotation transformations of binary trees, which is equivalent to the transformation of arithmetic expressions over an associative and commutative binary Ž . operation. The main results are 1 a full binary tree with

The number of defective colorings of gra

The number of defective colorings of graphs on surfaces

✍ Tom Rackham 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB 👁 1 views

A (k, 1)-coloring of a graph is a vertex-coloring with k colors such that each vertex is permitted at most 1 neighbor of the same color. We show that every planar graph has at least c n distinct (4, 1)-colorings, where c is constant and ≈ 1.466 satisfies 3 = 2 +1. On the other hand for any >0, we gi

A note on defective colorings of graphs

A note on defective colorings of graphs in surfaces

✍ Dan Archdeacon 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 2 views

A graph is (rn, k)-colorable if its vertices can be colored with rn colors in such a way that each vertex is adjacent to at most k vertices of the same color as itself. In a recent paper Cowen. Cowen, and Woodall proved that, for each compact surface S, there exists an integer k = k(S) such that eve