Hits :

First Author : Min Chen

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

Date of Publication : 2012-01-01

Document Type : 期刊

Journal : Journal of Combinatorial Optimization

Volume: Vol.24

Issue : No.3

Page Number : 299-318

ISSN : 1382-6905

Translation or Not : no

Key Words : Injective;coloring;K;4-minor;free;graph;Planar;graph;Maximum;degree

Abstract : A k-coloring of a graph G=(V,E) is a mapping c:V→{1,2,…,k}. The coloring c is injective if, for every vertex v∈V, all the neighbors of v are assigned with distinct colors. The injective chromatic number χ   i  (G) of G is the smallest k such that G has an