The following pages link to On the max coloring problem (Q690449):
Displaying 11 items.
- Maximum number of colors: C-coloring and related problems (Q408951) (← links)
- Max-coloring paths: tight bounds and extensions (Q454245) (← links)
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
- Capacitated max-batching with interval graph compatibilities (Q899311) (← links)
- Maximizing the number of unused colors in the vertex coloring problem (Q1336741) (← links)
- A note on online colouring problems in overlap graphs and their complements (Q1641110) (← links)
- Improved bounds for randomized preemptive online matching (Q1706142) (← links)
- Batch coloring of graphs (Q1755745) (← links)
- Maximizing the number of <i>q</i> -colorings (Q3059717) (← links)
- Approximating interval coloring and max-coloring in chordal graphs (Q3507752) (← links)
- Automata, Languages and Programming (Q5716853) (← links)