Conceptadvanced
Perfect elimination ordering
Also called PEO.
A vertex ordering in which each vertex's later neighbors form a clique; such an ordering exists exactly for chordal graphs.
A vertex ordering in which each vertex's later neighbors form a clique; such an ordering exists exactly for chordal graphs.
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 W1EBF1 Edit this page History Report an error