The following pages link to Mixed interval hypergraphs (Q1364778):
Displaying 19 items.
- On perfection and imperfection of one-realizations of a given set (Q294527) (← links)
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity (Q383764) (← links)
- Maximum number of colors: C-coloring and related problems (Q408951) (← links)
- Mixed hypergraphs and other coloring problems (Q868365) (← links)
- Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees (Q1045172) (← links)
- Pseudo-chordal mixed hypergraphs (Q1301719) (← links)
- Integer programming models for colorings of mixed hypergraphs (Q1594837) (← links)
- Coloring mixed hypergraphs: theory, algorithms and applications (Q1613673) (← links)
- More results on the smallest one-realization of a given set. II (Q1717199) (← links)
- Uncolorable mixed hypergraphs (Q1962044) (← links)
- The smallest uniform color-bounded hypergraphs which are one-realizations of a given set (Q2409524) (← links)
- A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2 (Q2488941) (← links)
- Coloring mixed hypertrees (Q2489959) (← links)
- Circular mixed hypergraphs. II: The upper chromatic number (Q2495897) (← links)
- Mixed unit interval bigraphs (Q2636551) (← links)
- Circular and uniquely colorable mixed hypergraphs (Q2731368) (← links)
- C-perfect hypergraphs (Q3055910) (← links)
- (Q3383637) (← links)
- Mixed hypergraphs and beyond (Q5198021) (← links)