On the chromaticity of sunflower hypergraphs SH(n,p,h)

DOI10.1016/J.DISC.2006.07.026zbMATH Open1113.05039OpenAlexW2066861491MaRDI QIDQ868346FDOQ868346

Authors: 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

Recommendations

• Sunflower hypergraphs are chromatically unique
• On k-chromatically unique and k-chromatically equivalent hypergraphs
• Some results on chromaticity of quasilinear hypergraphs
• Chromatic polynomials of some sunflower mixed hypergraphs
• Chromatic polynomials of hypergraphs

zbMATH Keywords

chromatic polynomialchromatic uniqueness

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Intersection Theorems for Systems of Sets
• On chromatic equivalence of graphs
• The search for chromatically unique graphs
• Title not available (Why is that?)
• Chromatic coefficients of linear uniform hypergraphs
• Chromatic polynomials of hypergraphs
• Sunflower hypergraphs are chromatically unique

Cited In (12)

• Problems on chromatic polynomials of hypergraphs
• Series-parallel chromatic hypergraphs
• On the chromaticity of multi-bridge hypergraphs
• Some properties of chromatic coefficients of linear uniform hypergraphs
• Zero-free intervals of chromatic polynomials of hypergraphs
• Some results on chromaticity of quasilinear hypergraphs
• On extremal spectral radius of blow-up uniform hypergraphs
• Sunflower hypergraphs are chromatically unique
• On the chromaticity of quasi linear hypergraphs
• On \(P\)-unique hypergraphs
• Hypergraphs with pendant paths are not chromatically unique
• Chromatic polynomials of some sunflower mixed hypergraphs

This page was built for publication: On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868346)