TIL (well, revisited): bipartite graphs are just graphs with no odd-length cycles. Checking one is basically BFS with 2-coloring: color a node, force all its neighbors to the opposite color, and if you ever hit a conflict, it's not bipartite. O(V+E), and it doubles as the matching setup for job to worker assignment problems. Nice how cleanly it connects to stuff I already use for graph traversal.