Highly Influenced

# Bounding χ in terms of ω and Δ for some classes of graphs

@article{Aravind2011BoundingI, title={Bounding χ in terms of ω and Δ for some classes of graphs}, author={N. R. Aravind and T. Karthick and C. R. Subramanian}, journal={Discrete Mathematics}, year={2011}, volume={311}, pages={911-920} }

- Published 2011 in Discrete Mathematics
DOI:10.1016/j.disc.2011.02.021

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. © 2011 Elsevier B.V. All rights reserved.

Highly Cited

This paper has 17 citations. REVIEW CITATIONS

#### From This Paper

##### Figures, tables, and topics from this paper.

11 Citations

22 References

Similar Papers