All challenges

Choose edges forming an MST for the source online-spanning-tree instance.

Output a fixed-length graph walk visiting every clearing while delaying valuable first visits.

Select a large independent set for an undirected graph.

Select a large clique in an undirected graph.

Partition graph vertices to maximize crossing edges.

Color a large graph with three colors while minimizing conflicts.

Construct a compact weighted DAG whose paths represent exactly one integer interval.

Reconstruct the hidden graph used by triple-edge-count queries.

Select an independent set under the original complement-style Frontier-CS scoring formula.

Emit the static reference token for the graph-game migration payload.

Find a long no-repeat path in a directed graph and score by path-length thresholds.

Assign three colors to minimize conflicting graph edges.