Abstract
We prove that every finite 3-colorable graph has an odd-distance faithful representation in the plane. In other words, we can draw it in the plane so that any two vertices are connected by an edge if and only if their distance is an odd integer.
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.
