Minimal coloring and strength of graphs

Discrete Mathematics

Volumn 215, Issue 1-3, 2000, Pages 265-270

  Hajiabolhassan, H ^a   Mehrabadi, M L ^a   Tusserkani, R ^a  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Chromatic sum; Minimal coloring; Strength

Indexed keywords

EID: 0347647567     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00319-2     Document Type: Article

References (12)

1. M. Behzad, G. Chartrand, L. Lesniak-Foster, Graphs and Digraphs, Prindle, Weber & Schmidt, Boston, MA, 1979.
2. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Elsevier, New York, 1976.
3. P. Erdos, A. Hajnal, On chromatic number of graphs and set-systems, Acta Math. Acad. Sci. Hungar. 17 (1966) 61-99.
4. P. Erdos, E. Kubicka, A.J. Schwenk, Graphs that require many colors to achieve their chromatic sum, Congr. Numer. 71 (1990) 17-28.
5. S. Fiorini, R.J. Wilson, Edge-Colorings of Graphs, in: L.W. Beinike, R.J. Wilson (Eds.), Selected Topics in Graph Theory I, Academic Press, New York, 1978, pp. 103-126.
6. H. Hajiabolhassan, M.L. Mehrabadi, R. Tusserkani, Tabular graphs and chromatic sum, submitted for publication.
7. T. Jiang, D.B. West, Coloring of trees with minimum sum of colors, preprint.
8. E. Kubicka, The chromatic sum of a graph, Ph.D. Dissertation, Western Michigan University, 1989.
9. E. Kubicka, A.J. Schwenk, An introduction to chromatic sums, Proceedings of the ACM Computer Science Conference, Louisville, KY, 1989, pp. 39-45.
10. D.R. Lick, A.T. White, k-Degenerate graphs, Canad. J. Math. 22 (1970) 1082-1096.
11. C. Thomassen, P. Erdos, Y. Alavi, P.J. Malde, A.J. Schwenk, Tight bounds on the chromatic sum of a connected graph, J. Graph Theory 13 (1989) 353-357.
12. Z. Tuza, Contraction and minimal k-colorability, Graphs Combin. 6 (1990) 51-59.