2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles

A vertex coloring is said to be 2-distance if any two distinct vertices of distance at most 2 get different colors. Let $G$ be a planar graph without 4-cycles and 5-cycles. Cranston and Jaeger prov...