Algorithmintro
Welsh-Powell algorithm
Also called largest-first coloring.
Greedy coloring that processes vertices in order of decreasing degree.
Greedy coloring that processes vertices in order of decreasing degree.
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 NAP2ZB Edit this page History Report an error