Color-bounded hypergraphs, III: model comparison

MaRDI QIDQ3649378zbMATH OpenFDO

Authors Csilla Bujtás, Zsolt Tuza

Publication date 3 December 2009

zbMATH Keywords

chromatic polynomialvertex coloringmixed hypergraphhypergraph coloringcolor-bounded hypergraph

Mathematics Subject Classification ID

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

Recommendations

• Color-bounded hypergraphs. I: General results
• Color-bounded hypergraphs, IV: Stable colorings of hypertrees
• Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
• Hypergraph colouring
• Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees

Cited in

(13)

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

This page was built for publication: Color-bounded hypergraphs, III: model comparison

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