The chromaticity of a family of 2-connected 3-chromatic graphs with five triangles and cyclomatic number six
Halina Bielak · Discussiones Mathematicae Graph Theory · 1998
In this note, all chromatic equivalence classes for 2-connected 3-chromatic graphs with ve triangles and cyclomatic number six are described. New families of chromatically unique graphs of order n are presented for each n 8. This is a generalization of a result stated in [5]. Moreover, a proof for the conjecture posed in [5] is given.