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.
机构:
Univ Putra Malaysia, Dept Math, Serdang 43400, Selangor, Malaysia
Univ Putra Malaysia, Inst Math Res, Serdang 43400, Selangor, MalaysiaUniv Putra Malaysia, Dept Math, Serdang 43400, Selangor, Malaysia
Peng, Y. H.
Lau, G. C.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Putra Malaysia, Inst Math Res, Serdang 43400, Selangor, Malaysia
Univ Teknol MARA, Fac IT & Quantitat Sc, Johor Baharu, MalaysiaUniv Putra Malaysia, Dept Math, Serdang 43400, Selangor, Malaysia