摘要
研究了n类弦图的色性,分别给出G=k_(n+1)[K_m]K_(m+1)[K_m]K_(m+1);图G含有K_(n+1)子图,G=K_(n+1)[K_m]K_(m+1)[K_m]K_(m+1)[K_m]K_(m+1);G=K_(n+1)[K_m]K_(m+1)[K_l]K_(l+1)的充分必要条件。
The chromaticity of some kinds of chordal graphs is studied. Three necessary and sufficient conditions are given respectively for three kinds of chordal graphs:G=Kn+1[Km]Km+1[Km]Km+1,where G includes the subgraphKn+1,G=Kn+1[Km]Km+1[Km]Km+1,and G =Kn+1[Km]Km+1[Ki]
出处
《北京理工大学学报》
EI
CAS
CSCD
1993年第S1期203-207,共5页
Transactions of Beijing Institute of Technology
基金
国家自然科学基金
关键词
无向图/弦图
色多项式
色根
色等价
undirected graphs/chordal graph
chromatic polynomials
chromatic root
chromatic equivalent
