Mixed interval hypergraphs
From MaRDI portal
Recommendations
Cited in
(19)- Integer programming models for colorings of mixed hypergraphs
- Circular mixed hypergraphs. II: The upper chromatic number
- Circular and uniquely colorable mixed hypergraphs
- Mixed unit interval bigraphs
- On the Upper Chromatic Numbers of Mixed Interval Hypertrees
- 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
- Mixed hypergraphs and other coloring problems
- Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
- Coloring mixed hypergraphs: theory, algorithms and applications
- More results on the smallest one-realization of a given set. II
- Mixed hypergraphs and beyond
- Uncolorable mixed hypergraphs
- About perfection of circular mixed hypergraphs
- The smallest uniform color-bounded hypergraphs which are one-realizations of a given set
- A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
- Coloring mixed hypertrees
- C-perfect hypergraphs
This page was built for publication: Mixed interval hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364778)