Some Results on Chromaticity of Quasi-Linear Paths and Cycles

Electronic Journal Of Combinatorics

Ioan Tomescu¹ 

关键词: Quasi-linear hypergraph;    Sunflower hypergraph;    Quasi-linear path;    Quasi-linear cycle;    Chromatic polynomial;    Chromatic uniqueness;    Potential function;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Let $r\geq 1$ be an integer. An $h$-hypergraph $H$ is said to be $r$-quasi-linear (linear for $r=1$) if any two edges of $H$ intersect in 0 or $r$ vertices. In this paper it is shown that $r$-quasi-linear paths $P_{m}^{h,r}$ of length $m\geq 1$ and cycles

【 授权许可】

Others