The following pages link to (Q3496352):
Displaying 13 items.
- An on-line competitive algorithm for coloring bipartite graphs without long induced paths (Q524365) (← links)
- Online chromatic number is PSPACE-complete (Q726097) (← links)
- On-line 3-chromatic graphs. II: Critical graphs (Q1377872) (← links)
- Adding isolated vertices makes some greedy online algorithms optimal (Q1647831) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Batch coloring of graphs (Q1755745) (← links)
- On the Grundy number of graphs with few \(P_4\)'s (Q1759824) (← links)
- On the on-line chromatic number of the family of on-line 3-chromatic graphs (Q1916112) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- An On-line Competitive Algorithm for Coloring $$P_8$$-free Bipartite Graphs (Q2942656) (← links)
- Deciding the On-line Chromatic Number of a Graph with Pre-coloring Is PSPACE-Complete (Q2947029) (← links)
- Batch Coloring of Graphs (Q2971156) (← links)
- On Computational Aspects of Greedy Partitioning of Graphs (Q4632201) (← links)
