Color-bounded hypergraphs. I: General results
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1696541 (Why is no real title available?)
- scientific article; zbMATH DE number 1341914 (Why is no real title available?)
- scientific article; zbMATH DE number 1471072 (Why is no real title available?)
- scientific article; zbMATH DE number 786134 (Why is no real title available?)
- A broken-circuits-theorem for hypergraphs
- Chromatic polynomials of hypergraphs
- Color-bounded hypergraphs, III: model comparison
- Coloring mixed hypergraphs: theory, algorithms and applications
- Graph colorings with local constraints -- a survey
- Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types
- Mixed colorings of hypergraphs
- Mixed hypergraphs and other coloring problems
- Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
- On feasible sets of mixed hypergraphs
- On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
- Orderings of uniquely colorable hypergraphs
- The chromatic spectrum of mixed hypergraphs
- Uncolorable mixed hypergraphs
- Uniform mixed hypergraphs: the possible numbers of colors
- Uniquely colorable mixed hypergraphs
Cited in
(18)- Coloring hypergraphs with bounded cardinalities of edge intersections
- Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
- 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, III: model comparison
- Homogeneous colourings of graphs
- Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs
- Selective hypergraph colourings
- Mixed hypergraphs and beyond
- \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
- An algebraic formulation of hypergraph colorings
- Color-bounded hypergraphs, IV: Stable colorings of hypertrees
- Color-bounded hypergraphs. V: Host graphs and subdivisions
- Constrained colouring and \(\sigma\)-hypergraphs
- Colored hypergraph isomorphism is fixed parameter tractable
- 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
This page was built for publication: Color-bounded hypergraphs. I: General results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044919)