平面图的单射染色
Injective Coloring of Planar Graphs
-
Abstract: With Euler′s formula and Discharging Rules, it has been proved that if G be a planar graph with maximum degree Δ(G)≤6 and without 4,5,6,7-cycles, then the upper bound of injective chromatic number of G is Δ(G)+5.
-
-
计量
- 文章访问数: 817
- HTML全文浏览数: 491
- PDF下载数: 69
- 施引文献: 0