Abstract
An IC-planar graph is a graph that can be drawn in the plane in such a way that each edge is crossed at most once and each vertex is incident with at most one crossed edge. In this paper, we show that every IC-planar graph can be colored with nine colors so that for every non-isolate vertex there exists a color occurring odd times in its neighbors.
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.
