Title

3-Coloring Graphs Embedded In Surfaces

Keywords

Surfaces; Vertex colorings

Abstract

In this article, we show that there exists an integer k(∑) ≥ 5 such that, if G is a graph embedded in a surface ∑ without i-circuits, 4 ≤ i ≤ k(∑), then G is 3-colorable. © 2000 John Wiley & Sons, Inc.

Publication Date

1-1-2000

Publication Title

Journal of Graph Theory

Volume

33

Issue

3

Number of Pages

140-143

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1002/(SICI)1097-0118(200003)33:3<140::AID-JGT3>3.0.CO;2-3

Socpus ID

0034423260 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0034423260

This document is currently not available here.

Share

COinS