Problemintro
Bipartite graph recognition
Decides whether the vertices of a graph can be split into two sets with every edge crossing, using a graph traversal with two colors.
Decides whether the vertices of a graph can be split into two sets with every edge crossing, using a graph traversal with two colors.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 62CY51 Edit this page History Report an error