Title of article
A note on the chromaticity of some 2-connected (n,n+3)-graphs
Author/Authors
F.M. Dong، نويسنده , , K.L. Teo، نويسنده , , K.M. Koh، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
5
From page
217
To page
221
Abstract
Let P(G,λ) denote the chromatic polynomial of a graph G. A graph G is chromatically unique if G≅H for any graph H such that P(H,λ)=P(G,λ). This note corrects an error in the proof of the chromatic uniqueness of certain 2-connected graphs with n vertices and n+3 edges.
Keywords
Chromatic polynomial , Chromatically closed set , Homeomorphism class , Chromatic uniqueness , Chromatically equivalence class
Journal title
Discrete Mathematics
Serial Year
2002
Journal title
Discrete Mathematics
Record number
949896
Link To Document