The following pages link to On-line P-coloring of graphs (Q5437222):
Displaying 15 items.
- Online multi-coloring on the path revisited (Q378204) (← links)
- Application of polynomial method to on-line list colouring of graphs (Q412279) (← links)
- On-line choice number of complete multipartite graphs: an algorithmic approach (Q490305) (← links)
- On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← links)
- Online chromatic number is PSPACE-complete (Q726097) (← links)
- Iterated colorings of graphs. (Q1427472) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Online coloring co-interval graphs (Q2380735) (← links)
- A tight bound for online colouring of disk graphs (Q2382668) (← links)
- Online Dual Edge Coloring of Paths and Trees (Q3453294) (← links)
- Online Bounded Coloring of Permutation and Overlap Graphs (Q3503553) (← links)
- (Q4010319) (← links)
- (Q4249728) (← links)
- Online hypergraph coloring with rejection (Q5501518) (← links)
- Online edge coloring via tree recurrences and correlation decay (Q6083466) (← links)