Chromatic polynomials of hypergraphs

DOI10.7151/dmgt.1128zbMath0979.05044OpenAlexW2046831378MaRDI QIDQ5890237

Mieczysław Borowiecki, Ewa Łazuka

Publication date: 17 February 2002

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/96d37068dedaeee47530a24e89bbe259d0f4898c

zbMATH Keywords

hypergraphchromatic polynomialhypertreechromatically unique

Mathematics Subject Classification ID

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

Related Items (13)

Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs ⋮ Sunflower hypergraphs are chromatically unique ⋮ Some properties of chromatic coefficients of linear uniform hypergraphs ⋮ Some Results on Chromaticity of Quasilinear Hypergraphs ⋮ On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\) ⋮ On chromaticity of 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 ⋮ Chromatic polynomials of mixed hypercycles ⋮ Problems on chromatic polynomials of hypergraphs ⋮ CHROMATIC POLYNOMIAL OF SEMI-UNIFORM HYPERSTAR

This page was built for publication: Chromatic polynomials of hypergraphs