Abstract
The k-2-distance coloring of graph G 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 k such that G has a k-2-distance coloring, denoted by [Formula: see text]. In this paper, we prove that every planar graph G without 3-cycles and intersecting 4-cycles and [Formula: see text] has [Formula: see text].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
