On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\)

DOI10.1016/j.disc.2006.07.026zbMath1113.05039OpenAlexW2066861491MaRDI QIDQ868346

Ioan Tomescu

Publication date: 2 March 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.07.026

zbMATH Keywords

chromatic polynomialchromatic uniqueness

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items

Some properties of chromatic coefficients of linear uniform hypergraphs ⋮ On the chromaticity of quasi linear hypergraphs ⋮ Some Results on Chromaticity of Quasilinear Hypergraphs ⋮ On extremal spectral radius of blow-up uniform hypergraphs ⋮ Hypergraphs with pendant paths are not chromatically unique ⋮ Zero-free intervals of chromatic polynomials of hypergraphs ⋮ Series-parallel chromatic hypergraphs ⋮ On P-unique hypergraphs ⋮ Problems on chromatic polynomials of hypergraphs ⋮ On the chromaticity of multi-bridge hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• The search for chromatically unique graphs
• Chromatic coefficients of linear uniform hypergraphs
• Sunflower hypergraphs are chromatically unique
• Intersection Theorems for Systems of Sets
• On chromatic equivalence of graphs
• Chromatic polynomials of hypergraphs