Hits :

First Author : Bu,Yuehua

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

Date of Publication : 2009-01-01

Document Type : 期刊

Journal : Discrete Applied Mathematics

Volume: Vol.157

Issue : No.4

Page Number : 663-672

ISSN : 0166-218X

Translation or Not : no

Key Words : GRAPH;coloring;INJECTIVE;modules;(Algebra);VERTEX;operator;algebras;GRAPH;theory;TOPOLOGICAL;degree

Abstract : A coloring of a graph is injective if its restriction to the neighborhood of any vertex is injective. The injective chromatic number of a graph is the least such that there is an injective -coloring. In this paper we prove that if is a planar graph with g