Sunflower hypergraphs are chromatically unique

DOI10.1016/j.disc.2004.02.015zbMath1047.05020OpenAlexW2049686477MaRDI QIDQ1877684

Ioan Tomescu

Publication date: 19 August 2004

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

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

zbMATH Keywords

hypergraphchromatic polynomialchromatically unique

Mathematics Subject Classification ID

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

Related Items (9)

Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs ⋮ Some Results on Chromaticity of Quasilinear Hypergraphs ⋮ On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\) ⋮ 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 ⋮ On P-unique hypergraphs ⋮ Problems on chromatic polynomials of hypergraphs ⋮ Multiple Domination

Cites Work

• Unnamed Item
• The search for chromatically unique graphs
• Chromatic coefficients of linear uniform hypergraphs
• On chromatic equivalence of graphs
• Chromatic polynomials of hypergraphs

This page was built for publication: Sunflower hypergraphs are chromatically unique