The following pages link to Uncolorable mixed hypergraphs (Q1962044):
Displaying 18 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)
- Color-bounded hypergraphs, IV: Stable colorings of hypertrees (Q968415) (← links)
- Orderings of uniquely colorable hypergraphs (Q997065) (← links)
- Color-bounded hypergraphs. I: General results (Q1044919) (← links)
- Colouring planar mixed hypergraphs (Q1591737) (← links)
- Integer programming models for colorings of mixed hypergraphs (Q1594837) (← links)
- Uniquely colorable mixed hypergraphs (Q1598826) (← links)
- On the upper chromatic number of \((v_3,b_2)\)-configurations (Q1613359) (← links)
- Colorability of mixed hypergraphs and their chromatic inversions (Q1956247) (← links)
- Complete colourings of hypergraphs (Q2279996) (← links)
- Uniform mixed hypergraphs: the possible numbers of colors (Q2482347) (← 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)
- Circular and uniquely colorable mixed hypergraphs (Q2731368) (← links)
- About some classes of mixed hypergraphs uniquely colorable with two colors (Q2748959) (← links)
- Circular and uniquely colorable mixed hypergraphs (Q2816048) (← links)