definition
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Definition
A graph is outerplanar here when it has a crossing-free straight-line drawing with every vertex on one circle, a compact certificate for having every vertex on the boundary of the outer face.
Lean source view on GitHub
| 1 | import Lax68.StraightLineDrawings |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Outerplanar graphs |
| 6 | type: definition |
| 7 | --- |
| 8 | A graph is outerplanar here when it has a crossing-free straight-line drawing |
| 9 | with every vertex on one circle, a compact certificate for having every |
| 10 | vertex on the boundary of the outer face. |
| 11 | -/ |
| 12 | |
| 13 | set_option autoImplicit false |
| 14 | |
| 15 | namespace Lax68.Outerplanar |
| 16 | |
| 17 | structure OuterplaneDrawing {V : Type*} (G : SimpleGraph V) |
| 18 | extends StraightLineDrawings.StraightLineDrawing G where |
| 19 | radius : ℝ |
| 20 | radius_pos : 0 < radius |
| 21 | onBoundary : |
| 22 | ∀ v : V, |
| 23 | let p := toStraightLineDrawing.point v |
| 24 | p.1 ^ 2 + p.2 ^ 2 = radius ^ 2 |
| 25 | |
| 26 | def IsOuterplanar {V : Type*} (G : SimpleGraph V) : Prop := |
| 27 | Nonempty (OuterplaneDrawing G) |
| 28 | |
| 29 | end Lax68.Outerplanar |
| 30 |
Community review
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.
0 comments