On k-chromatically unique and k-chromatically equivalent hypergraphs

DOI10.1016/j.endm.2006.06.010zbMath1201.05036OpenAlexW2052136450MaRDI QIDQ3439412

Ewa Drgas-Burchardt

Publication date: 29 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.endm.2006.06.010

zbMATH Keywords

colourings of hypergraphschromatic polynomials of hypergraphschromatically equivalence

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On chromaticity of hypergraphs
• On chromatic polynomials of hypergraphs
• An introduction to chromatic polynomials

This page was built for publication: On k-chromatically unique and k-chromatically equivalent hypergraphs