论文信息 - Hypergraphs with Pendant Paths are not Chromatically Unique - 字舞流文

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.

[1] Manfred Walter. Some Results on Chromatic Polynomials of Hypergraphs , 2009, Electron. J. Comb..

[2] Ioan Tomescu,et al. On the Chromaticity of Multi-Bridge Hypergraphs , 2009, Graphs Comb..

[3] Mieczyslaw Borowiecki,et al. Chromatic polynomials of hypergraphs , 2006, Discuss. Math. Graph Theory.

[4] Ioan Tomescu,et al. Chromatic Coefficients of Linear Uniform Hypergraphs , 1998, J. Comb. Theory, Ser. B.

[5] H. L. Abbott,et al. Intersection Theorems for Systems of Sets , 1972, J. Comb. Theory, Ser. A.

[6] Kee L. Teo,et al. The search for chromatically unique graphs , 1990, Graphs Comb..

[7] Ioan Tomescu. On the chromaticity of sunflower hypergraphs SH(n, p, h) , 2007, Discret. Math..

[8] Ioan Tomescu. Sunflower hypergraphs are chromatically unique , 2004, Discret. Math..

[9] Domingos Dellamonica,et al. On a conjecture of Thomassen concerning subgraphs of large girth , 2011, J. Graph Theory.

[10] Zoltán Füredi,et al. On finite set-systems whose every intersection is a Kernel of a star , 1983, Discret. Math..

[11] Ioan Tomescu,et al. On the Chromaticity of Quasi Linear Hypergraphs , 2013, Graphs Comb..

[12] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.

[13] Chong-Yun Chao,et al. On chromatic equivalence of graphs , 1978 .