Coloring mixed hypergraphs: theory, algorithms and applications
From MaRDI portal
Publication:1613673
zbMath1001.05003MaRDI QIDQ1613673
Publication date: 1 September 2002
Published in: Fields Institute Monographs (Search for Journal in Brave)
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)
Related Items
Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs ⋮ Colouring 4-cycle systems with equitably coloured blocks ⋮ 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 ⋮ \(F\)-WORM colorings: results for 2-connected graphs ⋮ The smallest uniform color-bounded hypergraphs which are one-realizations of a given set ⋮ Color-bounded hypergraphs. VI: Structural and functional jumps in complexity ⋮ Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs ⋮ Attempting perfect hypergraphs ⋮ Maximum number of colors: C-coloring and related problems ⋮ Reducing hypergraph coloring to clique search ⋮ The chromatic spectrum of 3-uniform bi-hypergraphs ⋮ An algebraic formulation of hypergraph colorings ⋮ Improper C-colorings of graphs ⋮ On the upper chromatic number and multiple blocking sets of PG(n,q) ⋮ Selective hypergraph colourings ⋮ 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 ⋮ On the balanced upper chromatic number of finite projective planes ⋮ On a heterochromatic number for hypercubes ⋮ On the spectrum of hypergraphs ⋮ On some colouring of 4-cycle systems with specified block colour patterns ⋮ Uniform mixed hypergraphs: the possible numbers of colors ⋮ Zero-free intervals of chromatic polynomials of hypergraphs ⋮ Smallest set-transversals of \(k\)-partitions ⋮ Color-bounded hypergraphs, IV: Stable colorings of hypertrees ⋮ Constrained colouring and \(\sigma\)-hypergraphs ⋮ Coloring mixed hypertrees ⋮ Circular mixed hypergraphs. II: The upper chromatic number ⋮ C-perfect hypergraphs ⋮ Enumerating some stable partitions involving Stirling and \(r\)-Stirling numbers of the second kind ⋮ Mixed hypergraphs and beyond ⋮ Mario Gionfriddo and mixed hypergraph coloring ⋮ \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum ⋮ Chromatic polynomials of mixed hypercycles ⋮ Orderings of uniquely colorable hypergraphs ⋮ The smallest one-realization of a given set. IV ⋮ On the balanced upper chromatic number of cyclic projective planes and projective spaces ⋮ The smallest one-realization of a given set. III ⋮ From a zoo to a zoology: Towards a general theory of graph polynomials ⋮ Equitably Colored Balanced Incomplete Block Designs ⋮ ℱ-WORM colorings of some 2-trees: partition vectors ⋮ Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs ⋮ Minimal vertex separators and new characterizations for dually chordal graphs ⋮ Color-bounded hypergraphs. I: General results ⋮ On Voloshin colorings in 3-hypergraph designs ⋮ Some classifications of graphs with respect to a set adjacency relation ⋮ \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs ⋮ The minimum chromatic spectrum of 3-uniform \(\mathcal{C}\)-hypergraphs ⋮ Approximability of the upper chromatic number of hypergraphs ⋮ Mixed colorings of hypergraphs ⋮ High girth hypergraphs with unavoidable monochromatic or rainbow edges
