Chromatic polynomials of some mixed hypergraphs

  title={Chromatic polynomials of some mixed hypergraphs},
  author={Julian A. Allagan and David L. Slutzky},
  journal={Australasian J. Combinatorics},
Motivated by a recent result of Walter [Electron. J. Combin. 16 (2009), R94] concerning the chromatic polynomials of some hypergraphs, we present the chromatic polynomials of several (non-uniform) mixed hypergraphs. We use a recursive process for generating explicit formulae for linear mixed hypercacti and multi-bridge mixed hypergraphs using a decomposition of the underlying hypergraph into blocks, defined via chains. Further, using an algebra software package such as Maple, one can use the… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
4 Citations
17 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 17 references

Coloring mixed hypergraphs: theory, algorithms and applications

  • V. I. Voloshin
  • Fields Institute Monographs,
  • 2002
Highly Influential
4 Excerpts

Separability and acyclicity in hypergraphs

  • B. D. Acharya
  • Graph theory, Proc. Symp., Calcutta 1976,
  • 1979
Highly Influential
4 Excerpts

The chromatic polynomials of some linear uniform hypergraphs

  • J. A. Allagan
  • Congr. Numerantium
  • 2007
1 Excerpt

Similar Papers

Loading similar papers…