Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4949757 | Discrete Applied Mathematics | 2017 | 11 Pages |
Abstract
A vertex coloring is called 2-distance if any two vertices at distance at most 2 from each other get different colors. Let Ï2(G) be the 2-distance chromatic number of a graph G. Suppose G is a plane graph with girth 5 and maximum degree Î. In this paper, we prove that if Îâ{7,8}, then Ï2(G)â¤Î+7. Furthermore, we show that Ï2(G)â¤Î+4 if Î is sufficiently large.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Wei Dong, Wensong Lin,