Hits :

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

Date of Publication : 1996-01-01

Document Type : 期刊

Journal : Journal of Graph Theory

Volume: Vol.22

Issue : No.1

Page Number : 29-37

ISSN : 0364-9024

Translation or Not : no

Abstract : Let G be a planar graph. The vertex face total chromatic number 13(G) of G is the least number of colors assigned to V(G)F(G) such that no adjacent or incident elements receive the same color. The main results of this paper are as follows: (1) We give the