Maximal outerplanar graphs are planar
Lax68.MaximalOuterplanarPlanar · concepts/Lax68/MaximalOuterplanarPlanar.lean · lax-68
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Every maximal outerplanar graph is planar.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax68.MaximalOuterplanar |
| 2 | import Lax68.Planar |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Maximal outerplanar graphs are planar |
| 7 | type: theorem |
| 8 | --- |
| 9 | Every maximal outerplanar graph is planar. |
| 10 | -/ |
| 11 | |
| 12 | set_option autoImplicit false |
| 13 | |
| 14 | namespace Lax68.MaximalOuterplanarPlanar |
| 15 | |
| 16 | /-- Every maximal outerplanar graph is planar. -/ |
| 17 | axiom maximalOuterplanar_planar {V : Type*} {G : SimpleGraph V} : |
| 18 | Lax68.MaximalOuterplanar.IsMaximalOuterplanar G → |
| 19 | Lax68.Planar.IsPlanar G |
| 20 | |
| 21 | end Lax68.MaximalOuterplanarPlanar |
| 22 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments