The following pages link to Randomized online graph coloring (Q4015271):
Displaying 30 items.
- Impartial coloring games (Q388789) (← links)
- Online coloring of bipartite graphs with and without advice (Q486981) (← links)
- On-line list colouring of random graphs (Q491533) (← links)
- Online vertex-coloring games in random graphs (Q532126) (← links)
- Online coloring of hypergraphs (Q656575) (← links)
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882) (← links)
- Online coloring graphs with high girth and high odd girth (Q974990) (← links)
- Online hypergraph coloring (Q975516) (← links)
- An on-line graph coloring algorithm with sublinear performance ratio (Q1124602) (← links)
- On-line coloring \(k\)-colorable graphs (Q1264277) (← links)
- Coloring inductive graphs on-line (Q1312187) (← links)
- Lower bounds for on-line graph coloring (Q1331951) (← links)
- On-line coloring of perfect graphs (Q1375694) (← links)
- On-line edge-coloring with a fixed number of colors (Q1566383) (← links)
- Adding isolated vertices makes some greedy online algorithms optimal (Q1647831) (← links)
- On the on-line chromatic number of the family of on-line 3-chromatic graphs (Q1916112) (← links)
- Online coloring known graphs (Q1967115) (← links)
- Tight bounds for online coloring of basic graph classes (Q2223701) (← links)
- Online coloring co-interval graphs (Q2380735) (← links)
- On-Line Coloring of Sparse Random Graphs and Random Trees (Q3128993) (← links)
- Online Graph Coloring Against a Randomized Adversary (Q3177338) (← links)
- THE GRAPH-BIN PACKING PROBLEM (Q3224960) (← links)
- (Q4249728) (← links)
- Parallel and On-Line Graph Coloring (Q4339004) (← links)
- Lower bounds for on-line graph coloring (Q4763409) (← links)
- Tight Bounds for Online Coloring of Basic Graph Classes (Q5111690) (← links)
- Online hypergraph coloring with rejection (Q5501518) (← links)
- Dynamic graph coloring (Q5915986) (← links)
- Online coloring and a new type of adversary for online graph problems (Q5970811) (← links)
- Online edge coloring via tree recurrences and correlation decay (Q6083466) (← links)
