scientific article

zbMath1246.05053MaRDI QIDQ3649378

Csilla Bujtás, Zsolt Tuza

Publication date: 3 December 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

chromatic polynomialvertex coloringmixed hypergraphhypergraph coloringcolor-bounded hypergraph

Mathematics Subject Classification ID

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

Related Items (13)

On perfection and imperfection of one-realizations of a given set ⋮ The smallest uniform color-bounded hypergraphs which are one-realizations of a given set ⋮ Color-bounded hypergraphs. VI: Structural and functional jumps in complexity ⋮ Problems on cycles and colorings ⋮ Maximum number of colors: C-coloring and related problems ⋮ An algebraic formulation of hypergraph colorings ⋮ Selective hypergraph colourings ⋮ On the structure of uniform one-realizations of a given set ⋮ Colorability of mixed hypergraphs and their chromatic inversions ⋮ Color-bounded hypergraphs, IV: Stable colorings of hypertrees ⋮ Constrained colouring and \(\sigma\)-hypergraphs ⋮ Mixed hypergraphs and beyond ⋮ Color-bounded hypergraphs. I: General results

This page was built for publication: