On chromaticity of hypergraphs Original Research Article

Let image be a simple hypergraph and let image denote its chromatic polynomial. Two hypergraphs image and image are chromatic equivalent if image. The equivalence class of image is denoted by image. Let image and image be two classes of hypergraphs. image is said to be chromatically characterized in image if for every image we have image. In this paper we prove that uniform hypertrees and uniform unicyclic hypergraphs are chromatically characterized in the class of linear hypergraphs