On feasible sets of mixed hypergraphs

zbMath1055.05058MaRDI QIDQ1883629

Daniel Král'

Publication date: 13 October 2004

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/124148

zbMATH Keywords

coloringmixed hypergraphfeasible set

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (21)

Spectrum of mixed bi-uniform hypergraphs ⋮ On perfection and imperfection of one-realizations of a given set ⋮ More result on the smallest one-realization of a given set ⋮ Maximum number of colors in hypertrees of bounded degree ⋮ Mixed hypergraphs and other coloring problems ⋮ The smallest uniform color-bounded hypergraphs which are one-realizations of a given set ⋮ Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs ⋮ The chromatic spectrum of 3-uniform bi-hypergraphs ⋮ On the structure of uniform one-realizations of a given set ⋮ The smallest one-realization of a given set. II. ⋮ More results on the smallest one-realization of a given set. II ⋮ Uniform mixed hypergraphs: the possible numbers of colors ⋮ Color-bounded hypergraphs, IV: Stable colorings of hypertrees ⋮ Coloring mixed hypertrees ⋮ The smallest one-realization of a given set. IV ⋮ The smallest one-realization of a given set. III ⋮ ℱ-WORM colorings of some 2-trees: partition vectors ⋮ Color-bounded hypergraphs. I: General results ⋮ Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees ⋮ The minimum chromatic spectrum of 3-uniform \(\mathcal{C}\)-hypergraphs ⋮ Approximability of the upper chromatic number of hypergraphs

This page was built for publication: On feasible sets of mixed hypergraphs