Injective coloring of planar graphs without intersecting 5-cycles
An injective coloring is a vertex coloring such that any two vertices sharing a common neighbor receive distinct colors.Let xi(G)be the injective chromatic number of a graph G.If G is a planar graph with girth at least 5 and without intersecting 5-circles,thenxi(G)≤ △+4 if △(G)≥ 9.
万方数据
维普
