Abstract
We characterize interval graphs in terms of a certain linear order on their vertex set. It turns out that with this linear order, the well-known greedy heuristic “always use the smallest available color” yields an exact coloring algorithm for interval graphs. In addition, the heuristic can be implemented to run in linear time.
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.
