Hits :

Affiliation of Author(s): 数理与信息工程学院

Document Type : 期刊

Journal : Graphs and Combinatorics

Page Number : 1-18

ISSN : 0911-0119;1435-5914

Translation or Not : no

Key Words : Embedded;graph;Euler;characteristic;Entire;coloring;Maximum;degree

Abstract : Let G be a graph embedded in a surface of nonnegative characteristic with maximum degree \. The entire chromatic number \ of G is the least number of colors such that any two adjacent or incident elements in \\cup E \cup F\) have different colors. In this