Pages that link to "Item:Q2942655"
From MaRDI portal
The following pages link to Lower Bounds for On-line Graph Colorings (Q2942655):
Displaying 6 items.
- An on-line competitive algorithm for coloring bipartite graphs without long induced paths (Q524365) (← links)
- An On-line Competitive Algorithm for Coloring $$P_8$$-free Bipartite Graphs (Q2942656) (← links)
- Online coloring and a new type of adversary for online graph problems (Q5918632) (← links)
- Online coloring and a new type of adversary for online graph problems (Q5970811) (← links)
- Colouring bottomless rectangles and arborescences (Q6110074) (← links)
- Online coloring of short intervals (Q6201896) (← links)
