A note on the chromaticity of some 2-connected (n, n+3)-graphs

被引:2
|
作者
Dong, FM
Teo, KL
Koh, KM
机构
[1] Massey Univ, Dept Fundamental Sci Math, Palmerston North, New Zealand
[2] Nanyang Technol Univ, Natl Inst Educ, Math & Math Grp, Singapore, Singapore
[3] Natl Univ Singapore, Dept Math, Singapore 117548, Singapore
关键词
chromatic polynomial; chromatic uniqueness; chromatically closed set; chromatically equivalence class; homeomorphism class;
D O I
10.1016/S0012-365X(01)00217-5
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let P(G, lambda) denote the chromatic polynomial of a graph G. A graph G is chromatically unique if G congruent to H for any graph H such that P(H, lambda) = P(G, lambda). This note corrects an error in the proof of the chromatic uniqueness of certain 2-connected graphs with n vertices and n + 3 edges. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:217 / 221
页数:5
相关论文
共 50 条