Hypergraphs with Pendant Paths are not Chromatically Unique

Discussiones Mathematicae Graph Theory

Tomescu Ioan¹ 

[1] Faculty of Mathematics and Computer Science University of Bucharest Str. Academiei, 14 010014 Bucharest, Romania;

关键词: sunflower hypergraph;    chromatic polynomial;    chromatic unique- ness;    pendant path;   

DOI  :  10.7151/dmgt.1699

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown