首页 | 本学科首页   官方微博 | 高级检索  
     检索      


The search for chromatically unique graphs
Authors:K M Koh  K L Teo
Institution:(1) Department of Mathematics, National University of Singapore, Singapore;(2) Department of Mathematics and Statistics, Massey University, New Zealand
Abstract:The number of vertex-colourings of a simple graphG in not more thanlambda colours is a polynomial inlambda. This polynomial, denoted byP(G, lambda), is called the chromatic polynomial ofG. A graphG is said to be chromatically unique, in shortchi-unique, ifH cong G for any graphH withP(H, lambda) = P(G, lambda). Since the appearance of the first paper onchi-unique graphs by Chao and Whitehead in 1978, various families of and several results on such graphs have been obtained successively, especially during the last five years. It is the aim of this expository paper to give a survey on most of the works done onchi-unique graphs. A number of related problems and conjectures are also included.1980 Mathematical Subject Classification. Primary 05C15This work was done while the author was visiting the Department of Mathematics, National University of Singapore.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号