Chromatic numbers of quadrangulations on closed surfaces
β Scribed by Dan Archdeacon; Joan Hutchinson; Atsuhiro Nakamoto; Seiya Negam; Katsuhiro Ota
- Publisher
- John Wiley and Sons
- Year
- 2001
- Tongue
- English
- Weight
- 138 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0364-9024
- DOI
- 10.1002/jgt.1005
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
It has been shown that every quadrangulation on any nonspherical orientable closed surface with a sufficiently large representativity has chromatic number at most 3. In this paper, we show that a quadrangulation G on a nonorientable closed surface N~k~ has chromatic number at least 4 if G has a cycle of odd length which cuts open N~k~ into an orientable surface. Moreover, we characterize the quadrangulations on the torus and the Klein bottle with chromatic number exactly 3. By our characterization, we prove that every quadrangulation on the torus with representativity at least 9 has chromatic number at most 3, and that a quadrangulation on the Klein bottle with representativity at least 7 has chromatic number at most 3 if a cycle cutting open the Klein bottle into an annulus has even length. As an application of our theory, we prove that every nonorientable closed surface N~k~ admits an eulerian triangulation with chromatic number at least 5 which has arbitrarily large representativity. Β© 2001 John Wiley & Sons, Inc. J Graph Theory 37: 100β114, 2001
π SIMILAR VOLUMES
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.
Geometric properties are used to determine the chromatic number of AG(4, 3) and to derive some important facts on the chromatic number of PG(n, 2). It is also shown that a 4-chromatic STS(v) exists for every admissible order v β₯ 21.
Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their
## Abstract The 1βchromatic number Ο~1~(__S__~__p__~) of the orientable surface __S__~__p__~ of genus __p__ is the maximum chromatic number of all graphs which can be drawn on the surface so that each edge is crossed by no more than one other edge. We show that if there exists a finite field of ord