Chromatic polynomials of hypergraphs
Copyright policy )Chromatic polynomials of hypergraphs
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.
- Lublin University of Technology Poland
- University of Zielona Góra Poland
Coloring of graphs and hypergraphs, hypergraphs, Applied Mathematics, chromatic polynomials of hypergraphs, colourings, partitions in hypergraphs, Hypergraphs, chromatic coefficients
Coloring of graphs and hypergraphs, hypergraphs, Applied Mathematics, chromatic polynomials of hypergraphs, colourings, partitions in hypergraphs, Hypergraphs, chromatic coefficients
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).6 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!