Abstract
AbstractA classical theorem of Brooks in graph coloring theory states that every connected graph G has its chromatic number less than or equal to its maximum degree , unless G is a complete graph or an odd cycle in which case is equal to . Brooks' theorem has been extended to list colorings by Erdős, Rubin, and Taylor (and, independently, by Vizing) and to some of their variants such as list T‐colorings and pair‐list colorings. The bichromatic number is a relatively new parameter arisen in the study of extremal hereditary properties of graphs. This parameter simultaneously generalizes the chromatic number and the clique covering number of a graph.In this article, we prove a theorem, akin to that of Brooks, which states that every graph G has its bichromatic number less than or equal to its bidegree , unless G belongs to a set of specified graphs in which case is equal to .
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.
