Hypergraphs with Pendant Paths are not Chromatically Unique

Abstract

In this note it is shown that every hypergraph containing a pendant path of length at least 2 is not chromatically unique. The same conclusion holds for h-uniform r-quasi linear 3-cycle if r ≥ 2.

Keywords

• sunflower hypergraph
• chromatic polynomial
• chromatic unique- ness
• pendant path