Recursive Largest First on a 6-vertex bipartite graph — the numbers show each vertex's block count
Step 0 of 0
What's happening
Press Next to begin.
Legend
Uncolored — eligible for current class
In current class (same color)
Blocked — adjacent to current class
Color classes so far
None yet
Block-counting rule: When growing a color class, RLF adds the eligible vertex with the most neighbors already blocked.
The number on each vertex is that count. Picking the most-blocked vertex costs the fewest new exclusions, so each color class ends up packed as tightly as possible — which means fewer colors overall.