Pages that link to "Item:Q2346334"
From MaRDI portal
The following pages link to Approximability of the upper chromatic number of hypergraphs (Q2346334):
Displaying 5 items.
- Maximum number of colors in hypertrees of bounded degree (Q302137) (← links)
- Upper bound in the Erdős-Hajnal problem of hypergraph coloring (Q1947784) (← links)
- A primal-dual property of the upper chromatic number of mixed hypergraphs (Q2741320) (← links)
- Approximations to <i>m</i>‐Colored Complete Infinite Hypergraphs (Q3466346) (← links)
- On the hardness of approximating the chromatic number (Q5932643) (← links)