On the Universal Structure of Maximal Planar Graphs
Abstract
This paper proves that every maximal planar graph $G$ admits a decomposition analogous to that of a solvable group. The role of normal subgroups is played by a special class of maximal planar graphs that we called normal graphs. Furthermore, we prove that for any normal graph there exists a homomorphism from it to $K_4$ analogous to the concept of origami.
Fields of Study & Subjects
Advanced Graph Theory Research
Structural Analysis and Optimization
Computational Geometry and Mesh Generation
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 14 September 2026
- Document type
- Preprint