Pages that link to "Item:Q408951"
From MaRDI portal
The following pages link to Maximum number of colors: C-coloring and related problems (Q408951):
Displaying 6 items.
- Maximum number of colors in hypertrees of bounded degree (Q302137) (← links)
- \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum (Q726653) (← links)
- Maximizing the number of unused colors in the vertex coloring problem (Q1336741) (← links)
- Approximability of the upper chromatic number of hypergraphs (Q2346334) (← links)
- Maximizing the number of <i>q</i> -colorings (Q3059717) (← links)
- Mixed hypergraphs and beyond (Q5198021) (← links)