Abstract
Reed [B. Reed, ω , Δ and χ , Journal of Graph Theory, 27 (1998) 177–212] conjectured that for any graph G , χ ( G ) ≤ ⌈ Δ ( G ) + ω ( G ) + 1 2 ⌉ , where χ ( G ) , ω ( G ) , and Δ ( G ) respectively denote the chromatic number, the clique number and the maximum degree of G . In this paper, we verify this conjecture for some special classes of graphs which are defined by families of forbidden induced subgraphs.
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.
