Hits :

First Author : Xiaoxue Hu

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

Date of Publication : 2017-01-01

Document Type : 期刊

Journal : Theoretical Computer Science

Volume: Vol.689

Page Number : 108-116

ISSN : 0304-3975

Translation or Not : no

Key Words : Embedded graph;Torus;Entire coloring;Maximum degree

Abstract : An embedded graph G = ( V , E , F ) on the torus is entirely k-colorable if V ∪ E ∪ F can be colored with k colors such that any two adjacent or incident elements receive different colors. In this paper, we prove that every embedded graph G on the torus w