Title

3-coloring graphs embedded in surfaces

Authors

Authors

Y. Zhao

Abbreviated Journal Title

J. Graph Theory

Keywords

vertex colorings; surfaces; Mathematics

Abstract

In this article, we show that there exists an integer k(Sigma) greater than or equal to 5 such that, if G is a graph embedded in a surface Sigma without i-circuits, 4 less than or equal to i less than or equal to k(Sigma), then G is 3-colorable. (C) 2000 John Wiley & Sons. Inc.

Journal Title

Journal of Graph Theory

Volume

33

Issue/Number

3

Publication Date

1-1-2000

Document Type

Article

DOI Link

http://dx.doi.org/10.1002/(sici)1097-0118(200003)33:3<140::aid-jgt3>3.0.co;2-3

Language

English

First Page

140

Last Page

143

WOS Identifier

WOS:000085540700003

ISSN

0364-9024

Recommended Citation

"3-coloring graphs embedded in surfaces" (2000). Faculty Bibliography 2000s. 2882.
https://stars.library.ucf.edu/facultybib2000/2882