Name
Abstract | ||
|---|---|---|
It was proved in [Y. Bu and C. Shang, List 2-distance coloring of planar graphs without short cycles, Discrete Math. Algorithm. Appl. 8 (2016) 1650013] that for every planar graph with girth g ≥ 5 and maximum degree Δ ≥ 12 is list 2-distance (Δ + 6)-colorable. In this paper, we proved that: for every planar graph with g ≥ 5 and Δ ≥ 30 is list 2-distance (Δ + 5)-colorable. |
Year | Venue | Field |
|---|---|---|
2018 | Discrete Math., Alg. and Appl. | Discrete mathematics,Combinatorics,Degree (graph theory),Mathematics,Planar graph |
DocType | Volume | Issue |
Journal | 10 | 4 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
2 | ||