Bounds for the chromatic number of graphs with partial information

@article{Coffman2003BoundsFT,
  title={Bounds for the chromatic number of graphs with partial information},
  author={William C. Coffman and S. Louis Hakimi and Edward F. Schmeichel},
  journal={Discrete Mathematics},
  year={2003},
  volume={263},
  pages={47-59}
}
We obtain bounds for the chromatic and clique numbers of a simple graph, 3rst in terms of the number of vertices and edges it contains, and then in terms of its vertex degrees. In every case, we examine the tightness of the bounds we obtain. We also brie7y discuss lower bounds for the independence number of a graph in terms of the same parameters. c © 2002 Elsevier Science B.V. All rights reserved. 

From This Paper

Figures, tables, and topics from this paper.
3 Citations
10 References
Similar Papers

References

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

An upper bound for the chromatic number of a graph and its application to timetabling problems

  • D.J.A. Welsh, M. B. Powell
  • Comput. J. 10
  • 1967
Highly Influential
4 Excerpts

Estimates of the chromatic number of connected graphs

  • A. P. Ershov, G. I. Kozhukhin
  • Soviet Math. Dok. 3
  • 1962
Highly Influential
2 Excerpts

Graphs and Digraphs

  • G. Chartrand, L. Lesniak
  • Chapman and Hall, London
  • 1996
1 Excerpt

Graphs and Hypergraphs

  • C. Berge
  • North-Holland, Amsterdam
  • 1973

G

  • D. W. Matula
  • Marble., J.D. Isaacson, Graph coloring algorithms…
  • 1972
1 Excerpt

A short proof of the factor theorem for 3nite graphs

  • W. T. Tutte
  • Canad. J. Math. 6
  • 1954
2 Excerpts

Eine Extremalaufgabe aus der Graphen-Theorie

  • P. Turan
  • Mat. Fiz. Lapook 48
  • 1941
2 Excerpts

On colouring the nodes of a network

  • R. L. Brooks
  • Proc. Cambridge Philos. Soc. 37
  • 1941

Similar Papers

Loading similar papers…