Hypergraphs with pendant paths are not chromatically unique

@article{Tomescu2014HypergraphsWP,
  title={Hypergraphs with pendant paths are not chromatically unique},
  author={Ioan Tomescu},
  journal={Discussiones Mathematicae Graph Theory},
  year={2014},
  volume={34},
  pages={23-29}
}
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.