Abstract.
In this paper, we first establish a useful inequality on the minimum real roots of the adjoint polynomials of the complete graphs. By using it, we investigate the chromatic uniqueness of certain complete multipartite graphs. An unsolved problem (i.e., Problem 11), posed by Koh and Teo in Graph and Combin. 6(1990) 259–285, is completely solved by giving it a positive answer. Moreover, many existing results on the chromatic uniqueness of complete multipartite graphs are generalized.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Acknowledgments. The authors are greatly indebted to the referees for their valuable comments and suggestions, which are very helpful for improving the presentation of the paper. The work is supported by National Science Foundation of China and the Science Foundation of the State Education Ministry of China.
Final version received: January 9, 2004
AMS Subject Classification (2000): 05C15, 05C60
Rights and permissions
About this article
Cite this article
Zhao, H., Li, X., Liu, R. et al. The Chromaticity of Certain Complete Multipartite Graphs. Graphs and Combinatorics 20, 423–434 (2004). https://doi.org/10.1007/s00373-004-0560-5
Received:
Issue Date:
DOI: https://doi.org/10.1007/s00373-004-0560-5