Pages that link to "Item:Q3189018"
From MaRDI portal
The following pages link to Max-coloring and online coloring with bandwidths on interval graphs (Q3189018):
Displayed 7 items.
- On the complexity of injective colorings and its generalizations (Q387816) (← links)
- First-Fit is linear on posets excluding two long incomparable chains (Q651432) (← links)
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
- Capacitated max-batching with interval graph compatibilities (Q899311) (← links)
- A new lower bound for the on-line coloring of intervals with bandwidth (Q1686078) (← links)
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)
- Selfish Routing and Path Coloring in All-Optical Networks (Q5458507) (← links)