Algorithmintro
Smallest-last ordering
Also called Matula ordering, degeneracy ordering.
Repeatedly remove a minimum-degree vertex; greedy coloring in reverse removal order uses at most degeneracy plus one colors.
Repeatedly remove a minimum-degree vertex; greedy coloring in reverse removal order uses at most degeneracy plus one 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 JTSFJW Edit this page History Report an error