Chromatic polynomials of hypergraphs

DOI10.1016/J.AML.2007.02.006MaRDI QIDQ5920448zbMATH OpenOpenAlexFDO

Authors Ewa Drgas-Burchardt, Ewa Łazuka

Publication date 25 February 2008

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aml.2007.02.006

zbMATH Keywords

chromatic coefficientschromatic polynomials of hypergraphscolouringshypergraphspartitions in hypergraphs

Mathematics Subject Classification ID

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

Review text

The authors investigate the number of \(\lambda\)-colourings of the vertices of a hypergraph \(H\) such that each edge \(e_i\) of \(H\) contains at least \(x_i\) differently coloured vertices for given quantities \(x_1,\dots,x_m\) (one for each edge). They show that the number of such colourings can be expressed as a polynomial of degree \(n\) (the number of vertices of \(H\)) and as a sum of chromatic polynomials, and present a reduction formula generalizing similar formulae for standard colourings of graphs and hypergraphs.

Recommendations

• On chromatic polynomials of hypergraphs
• A contribution to the chromatic theory of uniform hypergraphs
• A geometric theory of hypergraph colouring
• Chromatic polynomials of hypergraphs
• Some properties of chromatic coefficients of linear uniform hypergraphs

Cites work

• A broken-circuits-theorem for hypergraphs
• An introduction to chromatic polynomials
• Chromatic coefficients of linear uniform hypergraphs
• Coefficients of chromatic polynomials
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• On chromatic coefficients
• On chromaticity of hypergraphs

Cited in

(26)

• Color-bounded hypergraphs. I: General results
• Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
• Chromatic polynomials and network reliability
• A geometric theory of hypergraph colouring
• Polychromatic polynomials
• Chromatic numbers of algebraic hypergraphs
• The chromatic polynomial of a digraph
• Chromatic polynomials of graphs from Kac-Moody algebras
• The smallest uniform color-bounded hypergraphs which are one-realizations of a given set
• Chromatic polynomials of mixed hypercycles
• Chromatic polynomials of simplicial complexes
• scientific article; zbMATH DE number 3887739 (Why is no real title available?)
• On k-chromatically unique and k-chromatically equivalent hypergraphs
• On chromatic polynomials of hypergraphs
• Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
• scientific article; zbMATH DE number 833904 (Why is no real title available?)
• Chromatic polynomials of some \((m,l)\)-hyperwheels
• Problems on chromatic polynomials of hypergraphs
• CHROMATIC POLYNOMIAL OF SEMI-UNIFORM HYPERSTAR
• CHROMATIC POLYNOMIALS AND BIALGEBRAS OF GRAPHS
• Mixed hypergraphs and beyond
• scientific article; zbMATH DE number 5237267 (Why is no real title available?)
• Polychromatic colorings of unions of geometric hypergraphs
• On multivariate chromatic polynomials of hypergraphs and hyperedge elimination
• Some properties of chromatic coefficients of linear uniform hypergraphs
• Color-bounded hypergraphs, IV: Stable colorings of hypertrees

This page was built for publication: Chromatic polynomials of hypergraphs

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