The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Some results on chromatic polynomials of hypergraphs.”

Hypergraphs with Pendant Paths are not Chromatically Unique

Ioan Tomescu (2014)

Discussiones Mathematicae Graph Theory

Similarity:

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.