No abstract

The [Formula: see text]-2-distance coloring of graph [Formula: see text] is a mapping [Formula: see text] if any two vertices at distance at most two from each other get different colors. The 2-distance chromatic number is the smallest integer [Formula: see text] such that [Formula: see text] has a [Formula: see text]-2-distance coloring, denoted by [Formula: see text]. In this paper, we prove that every planar graph [Formula: see text] without 3-cycles and intersecting 4-cycles and [Formula: see text] has [Formula: see text].