Abstract
Every graph of chromatic number $k$ with more than $k(r-1)(b-1)$ vertices has a $b$-element independent set of vertices such that if any two of them are joined by an edge then the chromatic number stays the same or a $r$-element independent set of vertices such that joining any two of them by an edge increases the chromatic number.
Sign-in/Register to access full text options 
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.
