Series–parallel chromatic hypergraphs Original Research Article

In this paper two-terminal series–parallel chromatic hypergraphs are introduced and for this class of hypergraphs it is shown that the chromatic polynomial can be computed with polynomial complexity. It is also proved that image-uniform multibridge hypergraphs image are chromatically unique for image if and only if image and image, i.e., when they are sunflower hypergraphs having a core of cardinality 2 and all petals being singletons.