Problemintro
Bipartiteness checking
Also called Checking a graph for bipartiteness.
Problem of deciding whether a graph can be two-colored so no edge joins same-colored vertices, solved with a breadth-first or depth-first search.
Problem of deciding whether a graph can be two-colored so no edge joins same-colored vertices, solved with a breadth-first or depth-first search.
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 XC2A7V Edit this page History Report an error