Abstract
An injective coloring of a graph is a vertex coloring where two vertices have distinct colors if a path of length two exists between them. Let G be a plane graph with g(G)≥5 and χi(G) be the injective chromatic number of G. In this paper, we improve some known results by proving that χi(G)≤Δ+3 if Δ(G)≥35 and χi(G)≤Δ+6 for arbitrary Δ(G).
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.
