Pages that link to "Item:Q5111690"
From MaRDI portal
The following pages link to Tight Bounds for Online Coloring of Basic Graph Classes (Q5111690):
Displaying 8 items.
- Online chromatic number is PSPACE-complete (Q726097) (← links)
- Batch coloring of graphs (Q1755745) (← links)
- A tight bound for online colouring of disk graphs (Q2382668) (← links)
- Max-coloring and online coloring with bandwidths on interval graphs (Q3189018) (← links)
- Online Bounded Coloring of Permutation and Overlap Graphs (Q3503553) (← links)
- (Q4010319) (← links)
- Structural Information and Communication Complexity (Q5710098) (← links)
- Online coloring and a new type of adversary for online graph problems (Q5918632) (← links)