Abstract
We prove the first χ \chi -bounding function for circle graphs that is optimal up to a constant factor. To be more precise, we prove that every circle graph with clique number at most ω \omega has chromatic number at most 2 ω log 2 ( ω ) + 2 ω log 2 ( log 2 ( ω ) ) + 10 ω 2\omega \log _2 (\omega ) +2\omega \log _2(\log _2 (\omega )) + 10\omega .
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.
