Color-bounded hypergraphs. I: General results
From MaRDI portal
Publication:1044919
DOI10.1016/j.disc.2008.04.019zbMath1210.05088OpenAlexW1988899757WikidataQ59072702 ScholiaQ59072702MaRDI QIDQ1044919
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.019
hypergraphchromatic polynomialvertex coloringmixed hypergraphfeasible setuniquely colorable hypergraph
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)
Related Items
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 ⋮ Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs ⋮ An algebraic formulation of hypergraph colorings ⋮ Selective hypergraph colourings ⋮ On the structure of uniform one-realizations of a given set ⋮ More results on the smallest one-realization of a given set. II ⋮ Color-bounded hypergraphs, IV: Stable colorings of hypertrees ⋮ Constrained colouring and \(\sigma\)-hypergraphs ⋮ Mixed hypergraphs and beyond ⋮ \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs ⋮ Homogeneous colourings of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
- Mixed hypergraphs and other coloring problems
- Orderings of uniquely colorable hypergraphs
- A broken-circuits-theorem for hypergraphs
- Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
- Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types
- Uniquely colorable mixed hypergraphs
- The chromatic spectrum of mixed hypergraphs
- Coloring mixed hypergraphs: theory, algorithms and applications
- On feasible sets of mixed hypergraphs
- Uncolorable mixed hypergraphs
- Uniform mixed hypergraphs: the possible numbers of colors
- Mixed colorings of hypergraphs
- Graph colorings with local constraints -- a survey
- Chromatic polynomials of hypergraphs
This page was built for publication: Color-bounded hypergraphs. I: General results