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}
}
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

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Claw-free graphs and two conjectures on omega

  • A. D. King
  • Delta, and chi, Ph.D. Thesis, McGill University
  • 2009
Highly Influential
6 Excerpts

Ω

  • B. Reed
  • ∆ and χ , Journal of Graph Theory 27
  • 1998
Highly Influential
4 Excerpts

Introduction to Graph Theory

  • D. B. West
  • 2nd ed., Prentice-Hall, Englewood Cliffs, New…
  • 2000
Highly Influential
2 Excerpts

A computerized system for graph theory

  • D. Gernet, L. Rabern
  • illustrated by partial proofs for graph-coloring…
  • 2008
2 Excerpts

A computerized system for graph theory , illustrated by partial proofs for graphcoloring problems ,

  • H. Thuillier
  • Graph Theory Notes of New York LV
  • 2008

Similar Papers

Loading similar papers…