2009
DOI: 10.1137/070688262
|View full text |Cite
|
Sign up to set email alerts
|

k-Chromatic Number of Graphs on Surfaces

Abstract: A well-known result ) states that the maximum chromatic number of a graph embedded in a given surface S coincides with the size of the largest clique that can be embedded in S, and that this number can be expressed as a simple formula in the Euler genusWe derive a Heawood-type formula for the k-chromatic number of graphs embedded in a fixed surface, improving the previously known upper bounds. In infinitely many cases, the new upper bound coincides with the lower bound obtained from embedding disjoint cliques … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 13 publications
(15 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?